Bounds on double domination numbers of graphs
From MaRDI portal
Publication:3378348
zbMATH Open1163.05327MaRDI QIDQ3378348FDOQ3378348
Authors:
Publication date: 30 March 2006
Recommendations
lower boundsminimum degreediametergirthmaximum degreeorderupper boundsdouble domination numberdouble dominating set
Cited In (21)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Title not available (Why is that?)
- Combinatorial bounds on paired and multiple domination in triangulations
- Upper bounds for the domination number in graphs of diameter two
- New bounds on the double domination number of trees
- On the double bondage number of graphs products
- Double total domination of graphs
- On double bound graphs and forbidden subposets
- New bounds on the double total domination number of graphs
- Bounds on the double Italian domination number of a graph
- On Double Domination in Graphs
- Bounds on the domination number of a digraph
- Double domination in lexicographic product graphs
- A note on the double domination number in maximal outerplanar and planar graphs
- Title not available (Why is that?)
- On bounds for the index of double nested graphs
- Graphs with double domination numbers
- Exact double domination in graphs
- Note on strict-double-bound numbers of nearly complete graphs missing some edges
- Multiple domination
- Title not available (Why is that?)
This page was built for publication: Bounds on double domination numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378348)
