Bounds related to domination in graphs with minimum degree two
From MaRDI portal
Publication:4344216
DOI<139::AID-JGT6>3.0.CO;2-N 10.1002/(SICI)1097-0118(199706)25:2<139::AID-JGT6>3.0.CO;2-NzbMath0876.05047OpenAlexW2083585376MaRDI QIDQ4344216
Publication date: 15 July 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199706)25:2<139::aid-jgt6>3.0.co;2-n
Related Items (16)
Domination in planar graphs with small diameter* ⋮ Domination number in graphs with minimum degree two ⋮ Domination in partitioned graphs with minimum degree two ⋮ Restricted domination in graphs with minimum degree 2 ⋮ Girth and total domination in graphs ⋮ Restricted power domination and zero forcing problems ⋮ Dominating sets inducing large component in graphs with minimum degree two ⋮ Restricted domination parameters in graphs ⋮ Hardness results, approximation and exact algorithms for liar's domination problem in graphs ⋮ Restricted total domination in graphs ⋮ Graphs with large total domination number ⋮ On restricted domination in graphs ⋮ Total domination in 2-connected graphs and in graphs with no induced 6-cycles ⋮ An upper bound on the domination number of a graph with minimum degree 2 ⋮ Relating the size of a connected graph to its total and restricted domination numbers ⋮ Domination versus total domination in claw-free cubic graphs
This page was built for publication: Bounds related to domination in graphs with minimum degree two
