scientific article; zbMATH DE number 2076802
From MaRDI portal
Publication:4470232
Recommendations
- Upper bounds on the domination number of a graph in terms of order and minimum degree.
- Bounds related to domination in graphs with minimum degree two
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Bounds on the maximum number of minimum dominating sets
- scientific article; zbMATH DE number 861318
- Lower bounds on the total domination number of a graph
- Domination, radius, and minimum degree
- Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- Upper bounds on the total domination number
Cited In (9)
- Total domination in partitioned graphs
- Lower bounds on the total domination number of a graph
- Relationships between total domination, order, size, and maximum degree of graphs
- Title not available (Why is no real title available?)
- Optimal linear‐Vizing relationships for (total) domination in graphs
- Title not available (Why is no real title available?)
- Essential upper bounds on the total domination number
- Some remarks on domination
- Title not available (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470232)