Independent strong weak domination: A mathematical programming approach

DOI10.1142/S1793830920500627zbMath1457.05075OpenAlexW3033343386MaRDI QIDQ5858171

Murat Ersen Berberler, Onur Ugurlu, Zeynep Nihan Odabaş Berberler

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500627

zbMATH Keywords

mathematical programmingdominationindependent dominationstrong weak domination

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments on data reduction for optimal domination in networks
• The influence of special vertices on strong domination
• Strong weak domination and domination balance in a graph
• Perfect graphs of strong domination and independent strong domination
• On parameters related to strong and weak domination in graphs
• Bounds on the strong domination number
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Towards a theory of domination in graphs
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs

This page was built for publication: Independent strong weak domination: A mathematical programming approach