Keywords:-

Keywords: Graphoidal covers; path double covers; path double covering number of a graph; bicyclic graphs.

Article Content:-

Abstract

A path double cover of a graph G is a collection of paths in G such that every edge of G belongs to exactly two paths in . The minimum cardinality of a path double cover is called the path double covering number of G and is denoted by PD G .In this paper we determine the exact value of this parameter for several classes of graphs.

References:-

References

B.D. Acharya, E. Sampathkumar, Graphoidal covers and graphoidal covering number of a graph,

Indian J.Pure Appl.Math. 1987;18(10): 882-890.S.Arumugam, B.D.Acharya and E.Sampathkumar, Graphoidal covers ofa graph:a creative review,in

Proc.National Workshop on Graph theoryand its applications,ManonmaniamSundaranar

University,Tirunelveli,Tata McGraw-Hill,New Delhi,(1997),1-28.

S.Arumugam and S.Meena, Paths Double Covers of Graphs, Phd Thesis, Manonmaniam

Sundaranar University, 2000

S.Arumugam and J.Suresh Suseela, Acyclic graphoidal covers and path partitions in a graph,

Discrete Math.1998;190:67-77.

J. A. Bondy; Perfect path double covers of graphs, Journal of Graph Theory, 1990;14:259–272.

Joseph A. Gallian, A Dynamic Survey of Graph Labeling, The electronic Journal of combinatorics,

;16:1-308.

F.Harary, Graph Theory, Addison-Wesley, Reading , MA, 1969.

Hao Li, Perfect path double covers in every simple graph, Journal of Graph Theory,

;14(6):645–650.

Downloads

Citation Tools

How to Cite
Thiyagarajan, G., & Saravanan, M. (2014). Path Double Covering Number of a Graph. International Journal Of Mathematics And Computer Research, 2(08), 565-573. Retrieved from https://ijmcr.in/index.php/ijmcr/article/view/161