DEGREE BASED CALCULATION OF CYCLIC PATH COVERING NUMBER

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.