A new lower bound on the double domination number of a graph
From MaRDI portal
Publication:1720339
DOI10.1016/j.dam.2018.06.009zbMath1404.05152OpenAlexW2811376386WikidataQ129587753 ScholiaQ129587753MaRDI QIDQ1720339
Majid Hajian, Nader Jafari Rad
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.009
Related Items (7)
New bounds on the double domination number of trees ⋮ Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) ⋮ Double domination in rooted product graphs ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH ⋮ Double domination in lexicographic product graphs ⋮ Double domination in maximal outerplanar graphs ⋮ Double outer-independent domination number of graphs
Cites Work
This page was built for publication: A new lower bound on the double domination number of a graph