• ON 3-GRAPHOIDAL COVERING NUMBER OF GRAPHS

T. Gayathri*, S. Meena

Abstract


A 3-graphoidal cover of a graph G is a collection  of paths in G such that every path in  has at least two vertices, every vertex of G is an internal vertex of at most three paths in  and every edge of G is in exactly one path in . The minimum cardinality of a 3- graphoidal cover of G is called the  3-graphoidal  covering number of G and is denoted by


Keywords


Graphoidal covers, Acyclic graphoidal cover, 2-graphoidal cover.

Full Text:

pdf


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter