Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs
From MaRDI portal
Publication:2304394
DOI10.1007/s41980-019-00276-6zbMath1434.05104OpenAlexW2970153330WikidataQ127279974 ScholiaQ127279974MaRDI QIDQ2304394
Morteza Saghafian, Sharareh Alipour, A. H. Jafari
Publication date: 11 March 2020
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-019-00276-6
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
On (1,2)-domination in cubic graphs ⋮ Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma
Cites Work
This page was built for publication: Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs