ON 2-GRAPHOIDAL COVERING NUMBER OF A GRAPH
Prabir Kumar Das, Kevin Singh · International Journal of Pure and Apllied Mathematics · 2011
A 2-graphoidal cover of a graph G is a collection of paths (not necessarily open) in G such that every path in has at least two vertices, every vertex of G is an internal vertex of at most two paths in and every edge of G is in exactly one path in . The minimum cardinality of a 2-graphoidal cover of G is called the 2-graphoidal covering number of G and is denoted by �2(G) or �2. Here, we study 2-graphoidal covering number for some classes of graphs.