A characterization of graphs with global 3-rainbow domination number equal to the number of vertices

DOI10.20142/J.CNKI.AMAS.202401054MaRDI QIDQ6654092

Shuting Zeng, Guoliang Hao

Publication date: 18 December 2024

Published in: Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

complementglobal 3-rainbow dominating functionglobal 3-rainbow domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perfect double Roman domination of trees
• On the Roman domination subdivision number of a graph
• Global Roman domination in graphs
• Rainbow domination in graphs
• A new upper bound on the total domination number in graphs with minimum degree six
• On the global double Roman domination of graphs
• Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs
• On the global total $k$-domination number of graphs
• Triple Roman domination in graphs

This page was built for publication: A characterization of graphs with global 3-rainbow domination number equal to the number of vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654092)