Metro Domination Number of Certain Graphs
MDN
DOI:
https://doi.org/10.5269/bspm.80062Resumo
We study the metro domination number γβ(G), defined as the minimum size of a dominating set that also resolves a connected, simple, finite graph G. We present explicit formulas for γβ(G) for four classical graph families—Fan graphs, Firecracker graphs, Banana trees, and Coconut trees—together with concise proofs and examples. The presentation unifies domination and metric-dimension arguments, producing statements that are consistent with recent developments in the literature.
Downloads
Publicado
2026-02-04
Edição
Seção
Conf. Issue: International Conf. on Recent Trends in Appl. and Comput. Math.
Licença
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).
