A note on the 2-rainbow bondage numbers in graphs

DOI10.1142/S1793557116500133MaRDI QIDQ2806093zbMATH OpenFDO

Authors Lutz Volkmann, L. Asgharsharghi, Seyed Mahmood Sheikholeslami

Publication date 13 May 2016

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Euler characteristicaverage degreegirthrainbow domination numberrainbow bondage number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the 2-rainbow bondage number of planar graphs.
• The 2-rainbow bondage number in generalized Petersen graphs
• The k-rainbow bondage number of a graph
• Bounds on the 2-rainbow domination number of graphs
• On 2-rainbow domination and roman domination in graphs

Cites work

• Critical concept for 2-rainbow domination in graphs
• Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
• Note on the bondage number of graphs on topological surfaces
• Rainbow domination in graphs
• Rainbow domination on trees

Cited in

(4)

• The \(k\)-rainbow bondage number of a graph
• 2-bondage in graphs
• The spectrum for 2-perfect bowtie systems
• On the 2-rainbow bondage number of planar graphs.

This page was built for publication: A note on the 2-rainbow bondage numbers in graphs

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