Restrained geodetic domination of edge subdivision graph.

Autor: Mulloor, John Joy, Sangeetha, V.
Předmět:
Zdroj: Discrete Mathematics, Algorithms & Applications; Jul2022, Vol. 14 Issue 5, p1-17, 17p
Abstrakt: For a connected graph G = (V , E) , a set S subset of V (G) is said to be a geodetic set if all vertices in G should lie in some u − v geodesic for some u , v ∈ S. The minimum cardinality of the geodetic set is the geodetic number. In this paper, the authors discussed the geodetic number, geodetic domination number, and the restrained geodetic domination of the edge subdivision graph. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index