An upper bound for domination number of 5-regular graphs
From MaRDI portal
Recommendations
Cites work
- A note on the k-domination number of a graph
- Domination in graphs with minimum degree two
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4010553 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On Domination Number of 4-Regular Graphs
- Paths, Stars and the Number Three
Cited in
(9)- New probabilistic upper bounds on the domination number of a graph
- General bounds on rainbow domination numbers
- Remarks on the domination number of graphs
- On Domination Number of 4-Regular Graphs
- Regular dominating functions in regular graphs
- Regular set domination in graphs
- A note on total domination in 5-regular graphs
- A note on bounds for the broadcast domination number of graphs
- Dominating sets for uniform subset graphs
This page was built for publication: An upper bound for domination number of 5-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599930)