DEGREE BASED CALCULATION OF CYCLIC PATH COVERING NUMBER
##plugins.themes.bootstrap3.article.main##
##plugins.themes.bootstrap3.article.sidebar##
Abstract
In this paper three already known theorem which are proved in a lengthy and complicated manner are being proved in a simple and lucid manner. For proving these theorem, the degrees of the vertices only taken under consideration. The cyclic path covering number which are not easy to calculate for any arbitrary graph is becoming very simple by using these theorems.
AMS Subject Classification 2000 : 05C38, 05C45, 05C70.
How to Cite
##plugins.themes.bootstrap3.article.details##
COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY
Â
All paper submissions must carry the following duly signed by all the authors:
“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.â€