The set of all values of the domination number in trees with a given degree sequence
From MaRDI portal
Publication:5090145
DOI10.33048/DAIO.2020.27.656zbMATH Open1493.05231OpenAlexW4238500284MaRDI QIDQ5090145FDOQ5090145
Authors: 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
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
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Cites Work
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Largest domination number and smallest independence number of forests with given degree sequence
- A remark on the existence of finite graphs
- Improved bounds on the domination number of a tree
- Lower bound on the domination number of a tree
- On an extremal inverse problem in graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
