GEODESIC GRAPHOIDAL COVERING NUMBER OF BICYCLIC GRAPHS
Main Article Content
Abstract
A geodesic graphoidal cover of a graph G is a collection  of shortest paths in G such that every path in  has at least two vertices, every vertex of G is an internal vertex of at most one path in  and every edge of G is an exactly one path in . The minimum cardinality of a geodesic graphoidal cover of G is called the geodesic graphoidal covering number of G and is denoted by . In this paper  we determine  for bicyclic graphs.
Downloads
Article Details
References
References
B.D. Acharya and E. Sampathkumar, Graphoidal covers and graphoidal covering number of a graph,Indian J.Pure Appl.Math.18 (10) (1987), 882-890.
S.Arumugam, B.D.Acharya and E.Sampathkumar,Graphoidal covers of a 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 J.Suresh Suseela,Acyclic graphoidal covers and path partitions in a graph, Discrete Math.190(1998), 67-77
In S. Arumugam and J. Suresh Suseela ,Geodesic Graphoidal covering number of a graph J. Indian. Math. Soci., 72(2005), 99-106.
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) (1990), 645–650.
C.Packkiam and S.Arumugam, The graphoidal covering number of unicyclic graphs, Indian J.Pure appl.Math.23(2)(1992),141-143.
On Graphoidal Covers of Bicyclic Graphs. K.Ratan Singh and P.K.Das. International Mathematical Fourm, 5(42),(2010), 2093-2101.