CYCLIC DISTANCE IN GRAPHS

In this paper the concept of cyclic distance is introduced. For $u,v \in V(G)$ of a connected graph $G$, the cyclic distance between $u$ and $v$ is defined as the minimum number of cycles to be traversed from a cycle containing $u$ to a cycle containing $v$. Using this notion, cyclic radius and cyclic diameter of a graph are defined. Cyclic distance matrix of a graph is also introduced and some of its properties are studied.