Contents

Ars Combinatoria

  • Research article

Domination Numbers of \(m\)-Cactus Chains

Snježana Majstorović1, Antoaneta Klobučar2, Tomislav Doslic3
1Department of Mathematics, University of Osijek, Trg Ljudevita Gaja 6, HR-310C00 Osijek, Croatia
2Department of Mathematics, University of Osijek, Trg Ljudevita Gaja 6, HR-31000 Osijek, Croatia,
3Faculty of Civil Engineering, University of Zagreb, Katiéeva 26, HR-10000 Zagreb, Croatia
  • Published: 31/01/2016

Abstract

In this paper, we present explicit formulas for domination numbers of equidistant \(m\)-cactus chains and find the corresponding minimum dominating sets. For an arbitrary \(m\)-cactus chain, we establish the lower and upper bounds for its domination number. We find some extremal chains with respect to this graph invariant.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Snježana Majstorović, Antoaneta Klobučar, Tomislav Doslic. Domination Numbers of \(m\)-Cactus Chains[J], Ars Combinatoria, Volume 125. 11-22. .