Geodetic number of powers of cycles (Q2333891)

Summary: The geodetic number of a graph is an important graph invariant. \textit{M. Atici} [Int. J. Comput. Math. 79, No. 5, 587--591 (2002; Zbl 0999.05027)] showed the geodetic set determination of a graph is an NP-complete problem. In this paper, we compute the geodetic set and geodetic number of an important class of graphs called the \(k\)-th power of a cycle. This class of graphs has various applications in computer networks design and distributed computing. The \(k\)-th power of a cycle is the graph that has the same set of vertices as the cycle and two different vertices in the \(k\)-th power of this cycle are adjacent if the distance between them is at most \(k\).