Connected Geodetic Global Domination Number of a Graph
Journal of Electronics,Computer Networking and Applied Mathematics · 2021
DOI: 10.55529/jecnam.11.31.40 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Electronics,Computer Networking and Applied Mathematics, 2021. Verfasst von X. Lenin Xaviour und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 8 Literaturangaben.
Abstract (Originalsprache)
A set S of vertices in a connected graph {G=(V,E)} is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A set D of vertices in G is called a dominating set of G if every vertex not in D has at least one neighbour in D. A geodetic dominating set S is both a geodetic and a dominating set. A set S is called a geodetic global dominating set of G if S is both geodetic and global dominating set of G. The geodetic global domination number (geodetic domination number) is the minimum cardinality of a geodetic global dominating set (geodetic dominating set) in G. In this paper we introduced and investigate the connected geodetic global domination number of certain graphs and some of the general properties are studied.
Zitieren
APA
Xaviour, X. L., & Chellathurai, S. R. (2021). Connected Geodetic Global Domination Number of a Graph. Journal of Electronics,Computer Networking and Applied Mathematics. https://doi.org/10.55529/jecnam.11.31.40
Vancouver
Xaviour XL, Chellathurai SR. Connected Geodetic Global Domination Number of a Graph. Journal of Electronics,Computer Networking and Applied Mathematics. 2021. doi:10.55529/jecnam.11.31.40
BibTeX
@article{Xaviour2021,
author = {Xaviour, X. Lenin and Chellathurai, S. Robinson},
title = {Connected Geodetic Global Domination Number of a Graph},
journal = {Journal of Electronics,Computer Networking and Applied Mathematics},
year = {2021},
doi = {10.55529/jecnam.11.31.40}
}
EUVIMED