University of Isfahan Transactions on Combinatorics 2251-8657 14 3 2024 09 17 Induced Geodetic Sequence of a Graph 173 185 28592 10.22108/toc.2024.138982.2100 EN Liju Alex Olickal Department of Mathematics, Bishop Chulaparambil Memorial(BCM) College, Kottayam - 686001 John Joy Mulloor Department of Mathematics, Bishop Chulaparambil Memorial(BCM) College, Kottayam, Kerala, India Journal Article 2023 09 01 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. geodetic sequence geodetic number Diameter extreme vertex https://toc.ui.ac.ir/article_28592_09b21d4fb23b2b9e5ace659235425f85.pdf