Domination number of graphs with minimum degree five
From MaRDI portal
Publication:2656332
DOI10.7151/dmgt.2339zbMath1459.05232arXiv1912.13499OpenAlexW3110267038MaRDI QIDQ2656332
Publication date: 11 March 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.13499
Related Items (6)
Bounds on domination parameters in graphs: a brief survey ⋮ On the perfect differential of a graph ⋮ On the 2-domination Number of Cylinders with Small Cycles ⋮ Roman domination and independent Roman domination on graphs with maximum degree three ⋮ On the domination number of graphs with minimum degree six ⋮ Bounds on the paired domination number of graphs with minimum degree at least three
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Domination and total domination in cubic graphs of large girth
- A new bound on the domination number of graphs with minimum degree two
- Dominating sets in plane triangulations
- Dominating sequences in graphs
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- Transversal numbers of uniform hypergraphs
- On dominating sets of maximal outerplanar graphs
- Domination in graphs of minimum degree at least two and large girth
- Domination in graphs of minimum degree five
- On domination in connected cubic graphs
- Domination Game and an Imagination Strategy
- Domination number of cubic graphs with large girth
- Domination in graphs with minimum degree two
- DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
- Paths, Stars and the Number Three
This page was built for publication: Domination number of graphs with minimum degree five
