Induced Geodetic Sequence of a Graph
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 an...
| Published in: | Transactions on Combinatorics |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2024-09-01
|
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_28592_09b21d4fb23b2b9e5ace659235425f85.pdf |