The Primitive Hole Number of Certain Graphs
Abstract
A hole of a simple connected graph G is a chordless cycle Cn, where n ∈ N, n ≥ 4, in the graph G. The girth of a simple connected graph G is the smallest cycle in G, if any such cycle exists. It can be observed that all such smallest cycles are necessarily chordless. We call the cycle C3 in a given graph G a primitive hole of that graph. We introduce the notion of the primitive hole number of a graph as the number of primitive holes present in that graph. In this paper, we determine the primitive hole number of certain standard graphs. Also, we determine the primitive hole number of the underlying graph of a Jaco graph, J*n+1(1), where n ∈ N, n ≥ 4 recursively in terms of the underlying Jaco graph Jn(1), with prime Jaconian vertex vi. The notion of primitive degree of the vertices of a graph is also introduced and the primitive degree of the vertices of certain graphs is also determined in this paper.