Restrained geodetic domination of edge subdivision graph
- Title
- Restrained geodetic domination of edge subdivision graph
- Creator
- Mulloor J.J.; Sangeetha V.
- Description
- 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. 2022 World Scientific Publishing Company.
- Source
- Discrete Mathematics, Algorithms and Applications, Vol-14, No. 5
- Date
- 2022-01-01
- Publisher
- World Scientific
- Subject
- Edge subdivision; Extreme vertices; Geodetic domination; Geodetic number; Restrained geodetic domination
- 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
- Restricted Access
- Relation
- ISSN: 17938309
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Mulloor J.J.; Sangeetha V., “Restrained geodetic domination of edge subdivision graph,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 24, 2025, https://archives.christuniversity.in/items/show/15052.