Commenced in January 2007
Paper Count: 31584
Induced Acyclic Graphoidal Covers in a Graph
Abstract:An induced acyclic graphoidal cover of a graph G is a collection ψ of open paths in G such that every path in ψ has atleast two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced path. The minimum cardinality of an induced acyclic graphoidal cover of G is called the induced acyclic graphoidal covering number of G and is denoted by ηia(G) or ηia. Here we find induced acyclic graphoidal cover for some classes of graphs.
Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1078172Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1073
 B. D. Acharya, E. Sampathkumar, Graphoidal covers and graphoidal covering number of a graph, Indian J. Pure Appl. Math. 18 (10) (1987) 882-890.
 S. Arumugam, J. Suresh Suseela, Acyclic graphoidal covers and path partitins in a graph, Discrete Math., 190 (1998) 67-77 .
 S. Arumugam, B. D. Acharya, E. Sampathkumar, Graphoidal covers of a graph: a creative review, in Proc. National Workshop on Graph Theory and its applications, Manonmaniam Sundaranar University, Tirunelveli, Tata McGraw-Hill, New Delhi 1-28 1997.
 S. Arumugam, Path covers in graphs, Lecture Notes of the National Workshop on Decompositions of Graphs and Product Graphs held at Annamalai University, Tamil Nadu, during January 37, 2006.
 F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
 K. Ratan Singh, P. K. Das, On graphoidal covers of bicyclic graphs, (submitted for publication).
 K. Ratan Singh, P. K. Das, Induced Graphoidal Covers in a Graph, Int. J. of Mathematical and Statistical Sciences, 2 (3) (2010) 102-106.