Domination number, independent domination number and 2-independence number in trees
From MaRDI portal
Publication:2214304
DOI10.7151/dmgt.2165zbMath1453.05089OpenAlexW2897262652WikidataQ129098872 ScholiaQ129098872MaRDI QIDQ2214304
Nasrin Dehgardi, Lutz Volkmann, Mina Valinavaz, Seyyed Mahmoud Sheikholeslami, Hamideh Aram
Publication date: 8 December 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2165
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- Independence andk-domination in graphs
- Independent Roman domination and 2-independence in trees
- Mixed Roman domination and 2-independence in trees
- Trees with equal 2-domination and 2-independence numbers
- Roman domination and 2-independence in trees
This page was built for publication: Domination number, independent domination number and 2-independence number in trees