Restrained geodetic domination in the power of a graph

Title

Restrained geodetic domination in the power of a graph

Creator

Mulloor J.J.; Sangeetha V.

Description

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. 2024 Author(s).

Source

AIP Conference Proceedings, Vol-3037, No. 1

Date

2024-01-01

Publisher

American Institute of Physics

Subject

diameter; Power; RGD number

Coverage

Mulloor J.J., Department of Mathematics, CHRIST (Deemed to Be University), Bengaluru, 560029, India; Sangeetha V., Department of Mathematics, CHRIST (Deemed to Be University), Bengaluru, 560029, India

Rights

All Open Access; Bronze Open Access

Relation

ISSN: 0094243X

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1063/5.0196078

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85190462575&doi=10.1063%2f5.0196078&partnerID=40&md5=1630476845eae3f3d57d06225db0167d