Smallest domination number and largest independence number of graphs and forests with given degree sequence

DOI10.1002/jgt.22189zbMath1391.05085arXiv1507.04647OpenAlexW2963322507MaRDI QIDQ4575522

Dieter Rautenbach, Michael Gentner, Michael A. Henning

Publication date: 13 July 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.04647

zbMATH Keywords

independent setcliquedominating setdegree sequencerealizationforest realizationannihilation number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (5)

Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) ⋮ Some more updates on an annihilation number conjecture: pros and cons ⋮ The set of all values of the domination number in trees with a given degree sequence ⋮ On matching numbers of tree and bipartite degree sequences ⋮ On an annihilation number conjecture

This page was built for publication: Smallest domination number and largest independence number of graphs and forests with given degree sequence