The set of all values of the domination number in trees with a given degree sequence
From MaRDI portal
Publication:5090145
Recommendations
- Largest domination number and smallest independence number of forests with given degree sequence
- On the number of minimum dominating sets in trees
- On the number of dominating sets in some classes of trees
- Extremal trees with respect to dominance order.
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
Cites work
- scientific article; zbMATH DE number 996573 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 861343 (Why is no real title available?)
- A remark on the existence of finite graphs
- Improved bounds on the domination number of a tree
- Largest domination number and smallest independence number of forests with given degree sequence
- Lower bound on the domination number of a tree
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On an extremal inverse problem in graph theory
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
Cited in
(2)
This page was built for publication: The set of all values of the domination number in trees with a given degree sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090145)