scientific article; zbMATH DE number 1472173
From MaRDI portal
Publication:4489228
Recommendations
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- New probabilistic upper bounds on the domination number of a graph
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
- Upper bounds on the domination number of a graph in terms of order and minimum degree.
- Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
Cited in
(34)- Minimum partition of an independence system into independent sets
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- On upper domination Ramsey numbers for graphs.
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
- Upper bounds for the \(k\)-subdomination number of graphs
- Upper majority domination number of a graph
- Bounds on the domination number of a digraph
- Factor domination and minimum degree
- Bounds on domination parameters in graphs: a brief survey
- New probabilistic upper bounds on the domination number of a graph
- Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma
- Vertex-addition strategy for domination-like invariants
- Upper bounds for the paired-domination numbers of graphs
- Domination number of graphs with minimum degree five
- Remarks on the domination number of graphs
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Vizing's conjecture: a survey and recent results
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Paired domination in graphs
- A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
- scientific article; zbMATH DE number 4031749 (Why is no real title available?)
- An upper bound on the domination number of a graph.
- An upper bound for thek-domination number of a graph
- scientific article; zbMATH DE number 1792635 (Why is no real title available?)
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
- scientific article; zbMATH DE number 2174617 (Why is no real title available?)
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph
- Upper eccentric domination in graphs
- scientific article; zbMATH DE number 7489191 (Why is no real title available?)
- Upper minus total domination number of regular graphs
- Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
- Some upper bounds for the product of the domination number and the chromatic number of a graph
- New bounds on domination and independence in graphs
- A sharp upper bound on algebraic connectivity using domination number
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 Q4489228)
