Closed formulas for the independent (Roman) domination number of rooted product graphs

DOI10.1007/s00009-023-02565-1OpenAlexW4390263959MaRDI QIDQ6125366

Abel Cabrera Martínez, Juan Manuel Rueda-Vázquez

Publication date: 11 April 2024

Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00009-023-02565-1

zbMATH Keywords

rooted product graphsindependent dominationindependent Roman domination

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
• Roman domination in graphs.
• Independent domination in graphs: A survey and recent results
• Independent domination in bipartite cubic graphs
• Independent domination in subcubic graphs
• Domination, independent domination and \(k\)-independence in trees
• Strong equality between the Roman domination and independent Roman domination numbers in trees
• A new graph product and its spectrum
• Towards a theory of domination in graphs
• Independent Roman domination and 2-independence in trees
• A note on the independent domination number versus the domination number in bipartite graphs
• Lower bounds on the Roman and independent Roman domination numbers
• Domination-related parameters in rooted product graphs
• Further results on the independent Roman domination number of graphs

This page was built for publication: Closed formulas for the independent (Roman) domination number of rooted product graphs