Geodetic Number of Powers of Cycles
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 <i>k</i>-th power of a cycl...
Main Authors: | Mohammad Abudayah, Omar Alomari, Hassan Al Ezeh |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-11-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/10/11/592 |
Similar Items
-
The upper edge geodetic number and the forcing edge geodetic number of a graph
by: A. P. Santhakumaran, et al.
Published: (2009-01-01) -
The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity
by: H. Abdollahzadeh Ahangar, et al.
Published: (2017-12-01) -
On the edge geodetic and edge geodetic domination numbers of a graph
by: Vladimir Samodivkin
Published: (2020-06-01) -
On Minimal Geodetic Domination in Graphs
by: Nuenay Hearty M., et al.
Published: (2015-08-01) -
The geodetic domination number of comb product graphs
by: Dimas Agus Fahrudin, et al.
Published: (2020-10-01)