Induced Geodetic Sequence of a Graph

Abstract

A vertex subset $S$ of a graph $G=(V,E)$ is said to be a geodetic set if every vertex in $G$ is in some $u-v$ geodesic for any $u,v \in S$. The minimum cardinality of such a set is the geodetic number, which is denoted as $g(G)$. In this paper, we introduce the concepts of induced geodetic number and induced geodetic sequence of a graph. We discuss this concept in some graph classes. Also, established the characterization of induced geodetic sequences for trees, unicyclic graphs and cacti.

Keywords

• geodetic sequence
• geodetic number
• diameter
• extreme vertex