Metro Domination Number of Certain Graphs
MDN
Résumé
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.
Téléchargements
Copyright (c) 2026 Boletim da Sociedade Paranaense de Matemática
Ce travail est disponible sous la licence Creative Commons Attribution 4.0 International .
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).
