Largest domination number and smallest independence number of forests with given degree sequence
From MaRDI portal
Publication:277645
DOI10.1016/J.DAM.2016.01.040zbMath1335.05130arXiv1507.04650OpenAlexW1897792189MaRDI QIDQ277645
Dieter Rautenbach, Michael A. Henning, Michael Gentner
Publication date: 2 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04650
Related Items (4)
Largest domination number and smallest independence number of forests with given degree sequence ⋮ The set of all values of the domination number in trees with a given degree sequence ⋮ Some comments on the Slater number ⋮ On matching numbers of tree and bipartite degree sequences
Cites Work
- Largest domination number and smallest independence number of forests with given degree sequence
- Improved bounds on the domination number of a tree
- Graphs with equal independence and annihilation numbers
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences
- Lower bounds on the stability number of graphs computed in terms of degrees
- On the residue of a graph
- Lower bound on the domination number of a tree
- Degree sequences of graphs and dominance order
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Largest domination number and smallest independence number of forests with given degree sequence
