Linear programming approach for various domination parameters

DOI10.1142/S1793830920500962zbMath1458.05193OpenAlexW3042909566MaRDI QIDQ5859511

Pandiaraja Duraisamy, Shanmugam Esakkimuthu

Publication date: 16 April 2021

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

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

zbMATH Keywords

dominationrestrained dominationstrong domination

Mathematics Subject Classification ID

Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Strong restrained domination number on trees and product of graphs: An algorithmic approach ⋮ Linear programming formulation for some generalized domination parameters

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman domination on strongly chordal graphs
• On roman, global and restrained domination in graphs
• On the computational complexity of upper fractional domination
• Domination, independent domination, and duality in strongly chordal graphs
• Independent domination in chordal graphs
• Real and integer domination in graphs
• Strong weak domination and domination balance in a graph
• On the computational complexity of upper total domination
• Relating domination, exponential domination, and porous exponential domination
• New bounds for the broadcast domination number of a graph
• Domination, Fractional Domination, 2-Packing, and Graph Products