On strong and weak domination numbers in graphs

zbMATH Open1474.05314MaRDI QIDQ4986014FDOQ4986014

Authors: Guang Li, Junxia Zhang, Baogen Xu 

Publication date: 26 April 2021

Recommendations

• Strong-weak domatic numbers of graphs
• scientific article; zbMATH DE number 7671000
• Strong weak domination and domination balance in a graph
• On strong domination number of graphs
• A note on a relation between the weak and strong domination numbers of a graph

zbMATH Keywords

domination numberweak domination numberstrong domination number

Mathematics Subject Classification ID

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

Cited In (18)

• Strong-weak domatic numbers of graphs
• A note on a relation between the weak and strong domination numbers of a graph
• On weak domination in graphs
• Independent strong weak domination: A mathematical programming approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Weak and strong reinforcement number for a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on a graph representation of Padovan numbers
• Title not available (Why is that?)
• Bounds on the strong domination number
• On parameters related to strong and weak domination in graphs
• On strong (weak) independent sets and vertex coverings of a graph
• On weak domination in graphs
• Title not available (Why is that?)
• Strong weak domination and domination balance in a graph

This page was built for publication: On strong and weak domination numbers in graphs

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