Year: 2018
Type: article
Abstract: The geodetic number of a graph is an important graph invariant. In 2002, Atici 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.
Source: Symmetry
DOI: 10.3390/sym10110592
Institutions: German Jordanian University, University of Jordan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,896
OpenAlex ID: W2900242530