A FORMULA TO FIND CYCLIC PATH COVERING NUMBER OF DIGRAPH
Main Article Content
Abstract
In this paper we have established  some results to find cyclic path covering number of digraph based on the degree sequence. Already some results have been established to find the cyclic path covering number  of digraph for the Hamiltonian digraph. On a further development of that paper here we have established some more results to find the cyclic path covering number of any digraph based on the degree sequence of the digraph.
Downloads
Article Details
Open Access: This is an open-access journal. All articles published in the Journal of Global Research in Mathematical Archives(JGRMA) are made immediately and permanently available under the Creative Commons Attribution 4.0 International (CC BY 4.0) License. Authors retain the copyright of their work and grant Journal of Global Research in Mathematical Archives(JGRMA) the right of first publication. This license permits unrestricted use, distribution, adaptation, and reproduction in any medium or format, including commercial use, provided the original author(s), source, and license are properly acknowledged.
Google Scholar Indexed | DOI Enabled | OAI-PMH Compliant | Open Access Journal
References
F. Harary, Covering and packing in graphs I, Ann. N. Y. Acad. Sci., 175(1970), 198-205.
F. Harary and A. J Schwenk, Evolution of the path number of a graph, covering and packing in graphs II, Graph Theory and Computing, Eds. R. C. Road, Academic Press, New York, (1972), 39 - 45.
B. Peroche, The path number of some multipartite graphs, Annals of Discrete Math., 9(1982), 193-197.
R. G. Stanton, D. D. Cowan and L.O. James, Some result on path numbers, Proc. Louisiana Conf. on Combinatories, Graph theory and computing (1970), 112-135.
R. G. Stanton, D. D. Cowan and L.O. James, Tripartite path number, Graph Theory and Computing, Eds. R. C. Road, Academic Press, New York, (1973), 285-294.
A. Solairaju and G. Rajasekar, Electronic Notes in Discrete Mathematics (ELSEVIER) 33 (2009) 21–28.
On cyclic path covering Number of digraph, Indian Journal of Mathematics and Mathematical Sciences Vol. 5, No.2 (December 2009):211-219
A. Solairaju and G. Rajasekar, Categorization of Hamiltonian graph on the basis of Cyclic Path Covering Number, International Review of Pure and Applied Mathematics,5(2) (2009), 419-426.
A. Solairaju and G. Rajasekar, On cyclic path covering number of Cartesian product of graphs, Pacific Asian Journal of Mathematics, 3 (1-2) (2009).
G. Rajasekar, Cyclic Path Covering Number of Hypo Hamiltonian Graphs, AMO - Advanced Modeling and Optimization, Volume 15, Number 1, 2013.
G. Rajasekar, Cyclic Path Covering Number of Euler Graphs, Global Journal of Mathematical Sciences: Theory and Practical. Volume 4, Number 4 (2012), pp. 465–473, ISSN 0974-3200.