• SIMPLE GRAPHOIDAL COVERING NUMBER OF SNAKE GRAPHS

Abstract

A graphoidal cover of G is a collection of (not necessarily open) 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 in exactly one path in . The minimum cardinality of a graphoidal cover of G is called the graphoidal covering of G and is denoted by . If every two paths in have at most one common vertex, then it is called simple graphoidal cover of G. The minimum cardinality of a simple graphoidal cover of G is called simple graphoidal covering number of G and is denoted by  Here we determine the simple graphoidal covering number of Snake graphs.