Restrained geodetic domination in the power of a graph

For a graph G = (V,E), S ⊆ V(G) is a restrained geodetic dominating set, if S is a geodetic dominating (gd) set and never consists an isolated vertex. The least cardinality of such a set is known as the restrained geodetic domination (rgd) number. The power of a graph G is denoted as Gk and is obtai...

Full description

Saved in:
Bibliographic Details
Main Authors: Mulloor, John Joy, Sangeetha, V.
Format: Conference Proceeding
Language:English
Subjects:
Apexes
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For a graph G = (V,E), S ⊆ V(G) is a restrained geodetic dominating set, if S is a geodetic dominating (gd) set and never consists an isolated vertex. The least cardinality of such a set is known as the restrained geodetic domination (rgd) number. The power of a graph G is denoted as Gk and is obtained from G by making adjacency between the vertices provided the distance between those vertices must be at most k. In this study, we discussed geodetic number and rgd number of Gk.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0196078