Domination number and neighbourhood conditions
From MaRDI portal
Publication:1296973
Recommendations
- On the domination number of some graphs
- Upper bounds on the domination number of a graph in terms of order and minimum degree.
- Some results on characterizing the edges of connected graphs with a given domination number
- A linear vizing-like relation between the size and the domination number of a graph
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3531438 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3221976 (Why is no real title available?)
- A compilation of relations between graph invariants
- A compilation of relations between graph invariants—supplement I
- A generalization of Vizing's theorem on domination
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Domination in graphs with minimum degree two
- Estimations for the domination number of a graph
- Graph theory
- Maximum number of edges in connected graphs with a given domination number
- Updating the hamiltonian problem—A survey
Cited in
(2)
This page was built for publication: Domination number and neighbourhood conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296973)