The set of all values of the domination number in trees with a given degree sequence

DOI10.33048/daio.2020.27.656zbMath1493.05231OpenAlexW4238500284MaRDI QIDQ5090145

Artem Dmitrievich Kurnosov

Publication date: 15 July 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da944

zbMATH Keywords

treeinverse problemdegree sequencedomination numberrealizationrealization tree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Largest domination number and smallest independence number of forests with given degree sequence
• Improved bounds on the domination number of a tree
• On an extremal inverse problem in graph theory
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Smallest domination number and largest independence number of graphs and forests with given degree sequence
• Lower bound on the domination number of a tree

This page was built for publication: The set of all values of the domination number in trees with a given degree sequence