Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees

DOI10.1007/S40840-015-0284-0MaRDI QIDQ726513zbMATH OpenOpenAlexFDO

Authors M. Falahat, J. Amjadi, Seyed Mahmood Sheikholeslami, Nader Jafari Rad

Publication date 11 July 2016

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-015-0284-0

zbMATH Keywords

strong equality2-rainbow domination numberindependent 2-rainbow domination number

Mathematics Subject Classification ID

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

Recommendations

• Independent 2-rainbow domination in trees
• Trees with equal total domination and 2-rainbow domination numbers
• Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
• Independent 2-rainbow domination in graphs
• Total 2-rainbow domination numbers of trees

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 6749240 (Why is no real title available?)
• A characterization of graphs with equal domination number and vertex cover number
• A labeling algorithm for distance domination on block graphs
• New bounds on the rainbow domination subdivision number
• On the 2-rainbow domination in graphs
• On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
• Paired-domination in graphs
• Rainbow domination in graphs
• Signed \(k\)-domatic numbers of digraphs
• Strong equality of domination parameters in trees
• Strong equality of upper domination and independence in trees
• The k-rainbow bondage number of a graph
• The \(k\)-rainbow domatic number of a graph

Cited in

(9)

• A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
• Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
• Trees with equal total domination and 2-rainbow domination numbers
• General upper bounds on independent \(k\)-rainbow domination
• A new upper bound on the independent 2-rainbow domination number in trees
• Double Roman domination in digraphs
• Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
• Independent 2-rainbow domination in trees
• Rainbow domination in graphs

This page was built for publication: Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees

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