On the super domination number of lexicographic product graphs

DOI10.1016/j.dam.2018.03.082zbMath1414.05222DBLPjournals/dam/DettlaffLRZ19arXiv1703.06034OpenAlexW2600400793WikidataQ57974172 ScholiaQ57974172MaRDI QIDQ2420416

Rita E. Zuazua, Juan Alberto Rodríguez-Velázquez, Magda Dettlaff, Magdalena Lemańska

Publication date: 6 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.06034

zbMATH Keywords

NP-hardnessdomination numberlexicographic productdomination in graphssuper domination number

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (17)

Weak Roman domination in rooted product graphs ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Relating the super domination and 2-domination numbers in cactus graphs ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ Computational complexity aspects of super domination ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Super domination: graph classes, products and enumeration ⋮ Italian domination in rooted product graphs ⋮ Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ On the 2-packing differential of a graph ⋮ CONNECTED SUPER DOMINATION IN GRAPHS ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Protection of lexicographic product graphs ⋮ Super domination in trees ⋮ Super domination in trees ⋮ Double domination in lexicographic product graphs

Cites Work

• On the roman domination in the lexicographic product of graphs
• Super dominating sets in graphs
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
• Rainbow domination in the lexicographic product of graphs
• Associative graph products and their independence, domination and coloring numbers
• Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the super domination number of lexicographic product graphs