Independent k -rainbow bondage number of graphs

DOI10.1080/09728600.2023.2246529MaRDI QIDQ6651170

Seyyed Mahmoud Sheikholeslami, Jafar Amjadi, Mustapha Chellali, Farshid Najafi, Saeed Kosari

Publication date: 10 December 2024

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-rainbow bondage number of a graph
• On the Roman bondage number of planar graphs
• Rainbow domination in graphs
• The bondage number of a graph
• Bondage number of planar graphs
• Upper bound on 3-rainbow domination in graphs with minimum degree 2
• Bounding the \(k\)-rainbow total domination number
• Independent bondage number of a graph
• Independent rainbow domination of graphs
• Independent bondage number of planar graphs with minimum degree at least 3
• Roman bondage in graphs
• Rainbow Domination in Graphs
• Independent 2-rainbow domination in trees
• Total $k$-Rainbow domination numbers in graphs
• Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
• Independent Roman bondage of graphs
• Quasi-total Roman bondage number in graphs
• On the double Roman bondage numbers of graphs

This page was built for publication: Independent k -rainbow bondage number of graphs