Super domination: graph classes, products and enumeration

DOI10.1016/j.dam.2024.01.039arXiv2209.01795OpenAlexW4391830641MaRDI QIDQ6130203

Nima Ghanbari, Tuomo Lehtilä, Gerold Jäger

Publication date: 2 April 2024

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

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

zbMATH Keywords

domination numbersuper dominating set\(r\)-clique sumHajós sumneighbourhood corona product

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the maximum number of minimum dominating sets
• On the Laplacian spectra of some variants of corona
• Super dominating sets in graphs
• Trivially perfect graphs
• A fast algorithm to generate necklaces with fixed content
• Super domination in trees
• On the super domination number of lexicographic product graphs
• Spectra of the neighbourhood corona of two graphs
• A generalization of chordal graphs
• Graph minor theory
• On the super domination number of graphs
• Domination in Graphs: Core Concepts
• Double domination and super domination in trees

This page was built for publication: Super domination: graph classes, products and enumeration