Double domination in lexicographic product graphs
From MaRDI portal
Publication:777395
DOI10.1016/j.dam.2020.03.045zbMath1443.05139arXiv2008.00236OpenAlexW3015959374MaRDI QIDQ777395
Suitberto Cabrera García, Abel Cabrera Martínez, Juan Alberto Rodríguez-Velázquez
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.00236
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
New bounds on the double domination number of trees, From Italian domination in lexicographic product graphs to w-domination in graphs, Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs, Double domination in rooted product graphs, From \(w\)-domination in graphs to domination parameters in lexicographic product graphs, Relating the total \(\{2\}\)-domination number with the total domination number of graphs, From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs, Domination related parameters in the generalized lexicographic product of graphs, On the 2-packing differential of a graph, Closed formulas for the total Roman domination number of lexicographic product graphs, New bounds on the double total domination number of graphs, Double domination in maximal outerplanar graphs, Double outer-independent domination number of graphs
Cites Work
- Roman domination on strongly chordal graphs
- On the roman domination in the lexicographic product of graphs
- On the total Roman domination in trees
- A new lower bound on the double domination number of a graph
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- Total Roman domination in the lexicographic product of graphs
- On the super domination number of lexicographic product graphs
- On the weak Roman domination number of lexicographic product graphs
- Rainbow domination in the lexicographic product of graphs
- Associative graph products and their independence, domination and coloring numbers
- Double domination critical and stable graphs upon vertex removal
- Power Domination in Product Graphs
- Total domination in graphs
- Total Domination in Graphs
- Total Roman domination in graphs
- On Double Domination in Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item