Strong restrained domination number on trees and product of graphs: An algorithmic approach
From MaRDI portal
Publication:6059097
DOI10.1142/s1793830922501725zbMath1523.05034MaRDI QIDQ6059097
Pandiaraja Duraisamy, Unnamed Author, Shanmugam Esakkimuthu
Publication date: 2 November 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Computing the domination number of grid graphs
- Restrained domination in graphs
- Restrained domination in trees
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Linear programming formulation for some generalized domination parameters
- Linear programming approach for various domination parameters
This page was built for publication: Strong restrained domination number on trees and product of graphs: An algorithmic approach