# Article

Full entry | PDF   (0.3 MB)
Keywords:
geodetic set; geodetic number; extreme order; extreme geodesic graph
Summary:
For two vertices $u$ and $v$ of a graph $G$, the closed interval $I[u, v]$ consists of $u$, $v$, and all vertices lying in some $u\text{--}v$ geodesic of $G$, while for $S \subseteq V(G)$, the set $I[S]$ is the union of all sets $I[u, v]$ for $u, v \in S$. A set $S$ of vertices of $G$ for which $I[S]=V(G)$ is a geodetic set for $G$, and the minimum cardinality of a geodetic set is the geodetic number $g(G)$. A vertex $v$ in $G$ is an extreme vertex if the subgraph induced by its neighborhood is complete. The number of extreme vertices in $G$ is its extreme order $\mathop {\mathrm ex}(G)$. A graph $G$ is an extreme geodesic graph if $g(G) = \mathop {\mathrm ex}(G)$, that is, if every vertex lies on a $u\text{--}v$ geodesic for some pair $u$, $v$ of extreme vertices. It is shown that every pair $a$, $b$ of integers with $0 \le a \le b$ is realizable as the extreme order and geodetic number, respectively, of some graph. For positive integers $r, d,$ and $k \ge 2$, it is shown that there exists an extreme geodesic graph $G$ of radius $r$, diameter $d$, and geodetic number $k$. Also, for integers $n$, $d,$ and $k$ with $2 \le d < n$, $2 \le k < n$, and $n -d - k +1 \ge 0$, there exists a connected extreme geodesic graph $G$ of order $n$, diameter $d$, and geodetic number $k$. We show that every graph of order $n$ with geodetic number $n-1$ is an extreme geodesic graph. On the other hand, for every pair $k$, $n$ of integers with $2 \le k \le n-2$, there exists a connected graph of order $n$ with geodetic number $k$ that is not an extreme geodesic graph.
References:
[bf] T. Bonnesen and W. Fenchel: Theorie der konvexen Körper. Springer, Berlin, 1934; transl. by L. Boron, C. Christenson, and B. Smith: Theory of Convex Bodies. BCS Associates, Moscow, ID, 1987. MR 0920366
[bh:dg] F. Buckley and F. Harary: Distance in Graphs. Addison-Wesley, Redwood City, CA, 1990. MR 1045632
[BH2] F. Buckley and F. Harary: Closed geodetic games for graphs. Congr. Numer. 47 (1985), 131–138. MR 0830675
[BH3] F. Buckley and F. Harary: Geodetic games for graphs. Quaestiones Math. 8 (1986), 321–234. DOI 10.1080/16073606.1985.9631921 | MR 0854054
[chz:geo] G. Chartrand, F. Harary, and P. Zhang: On the geodetic number of a graph. Networks 39 (2002), 1–6. DOI 10.1002/net.10007 | MR 1871701
[chz:hn] G. Chartrand, F. Harary, and P. Zhang: On the hull number of a graph. Ars Combin 57 (2000), 129–138. MR 1796634
[cl:gd] G. Chartrand and L. Lesniak: Graphs $\&$ Digraphs, third edition. Chapman $\&$ Hall, New York, 1996. MR 1408678
[cwz:cn] G. Chartrand, C. E. Wall and P. Zhang: The convexity number of a graph. Graphs Combin. 18 (2002), 209–217. DOI 10.1007/s003730200014 | MR 1913663
[cz:fcn] G. Chartrand and P. Zhang: The forcing convexity number of a graph. Czechoslovak Math. J. 51(126) (2001), 847–858. DOI 10.1023/A:1013725215238 | MR 1864046
[cz:dgeo] G. Chartrand and P. Zhang: The geodetic number of oriented graphs. European J. Combin. 21 (2000), 181–189. DOI 10.1006/eujc.1999.0301 | MR 1742433
[cz:rrg] G. Chartrand and P. Zhang: Realizable ratios in graph theory: geodesic parameters. Bull. Inst. Combin. Appl. 27 (1999), 69–80. MR 1714291