Linear programming formulation for some generalized domination parameters
From MaRDI portal
Publication:5013502
DOI10.1142/S1793830921500440zbMath1475.05138OpenAlexW3099344741MaRDI QIDQ5013502
D. Pandiaraja, Rathinakumar Sivakumar, Esakkimuthu Shanmugam
Publication date: 30 November 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500440
Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Strong restrained domination number on trees and product of graphs: An algorithmic approach
Uses Software
Cites Work
- \([1,2\)-domination in graphs]
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Secondary domination in graphs
- Independent domination in chordal graphs
- Factor domination and minimum degree
- Integer linear programming models for the weighted total domination problem
- \([1,2\)-sets in graphs]
- Efficient (j,k)-domination
- R -Domination in Graphs
- Integer linear programming formulations for double roman domination problem
- Linear programming approach for various domination parameters
- Unsolved problems in number theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear programming formulation for some generalized domination parameters