Metro Domination Number of Triangular Snake Graph
International Journal of Creative and Open Research in Engineering and Management · 10.07.2026 · 02 (07) · 1-3
DOI: 10.55041/ijcope.v2i7.101 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Creative and Open Research in Engineering and Management, online erschienen am 10.07.2026. Verfasst von G C Basavaraju G C Basavaraju und 2 weiteren Autor:innen.
Abstract (Originalsprache)
A Subset of the vertex set of the graph is said to be a dominating set if every vertex in is adjacent to at least one vertex in . The minimum cardinality of the dominating set is called the domination number . The metro domination number is the order of a minimum dominating set which resolves as a metric set. It is denoted by . In this paper, we determine metro domination number of Triangular Snake graph. Keywords— Domination number, Metric dimension, Metro domination number, Locating domination number.
Zitieren
APA
Basavaraju, G. C. B. G. C., Shibaraya, R. S. R., & M, R. H. M. R. H. (2026). Metro Domination Number of Triangular Snake Graph. International Journal of Creative and Open Research in Engineering and Management, 02(07), 1-3. https://doi.org/10.55041/ijcope.v2i7.101
Vancouver
Basavaraju GCBGC, Shibaraya RSR, M RHMRH. Metro Domination Number of Triangular Snake Graph. International Journal of Creative and Open Research in Engineering and Management. 2026;02(07):1-3. doi:10.55041/ijcope.v2i7.101
BibTeX
@article{Basavaraju2026,
author = {Basavaraju, G C Basavaraju G C and Shibaraya, Rajeshwari Shibaraya Rajeshwari and M, Rakshitha H M Rakshitha H},
title = {Metro Domination Number of Triangular Snake Graph},
journal = {International Journal of Creative and Open Research in Engineering and Management},
year = {2026},
volume = {02},
number = {07},
pages = {1--3},
doi = {10.55041/ijcope.v2i7.101}
}
EUVIMED