全部 标题 作者
关键词 摘要


A FORMULA TO FIND CYCLIC PATH COVERING NUMBER OF DIGRAPH

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

comments powered by Disqus