Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
From MaRDI portal
Publication:2008916
DOI10.1016/j.amc.2018.12.009zbMath1428.05293OpenAlexW2911153821WikidataQ128507752 ScholiaQ128507752MaRDI QIDQ2008916
Simon Brezovnik, Tadeja Kraner Šumenjak
Publication date: 26 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.12.009
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Unnamed Item ⋮ Total domination in generalized prisms and a new domination invariant ⋮ Rainbow Domination in Graphs ⋮ Double domination in lexicographic product graphs
Cites Work
- \(k\)-domination and \(k\)-independence in graphs: A survey
- On the ratio of the domination number and the independent domination number in graphs
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- Rainbow domination in graphs
- Rainbow domination on trees
- Further results regarding the sum of domination number and average eccentricity
- Independent domination in graphs: A survey and recent results
- On \(k\)-rainbow independent domination in graphs
- On the super domination number of lexicographic product graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Some bounds on the \(p\)-domination number in trees
- Associative graph products and their independence, domination and coloring numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
