The restrained domination and independent restrained domination in extending supergrid graphs
From MaRDI portal
Publication:2695306
DOI10.1007/978-3-030-89543-3_34OpenAlexW3209142833MaRDI QIDQ2695306
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_34
dominationrestrained dominationsupergrid graphrectangular supergrid graphdiagonal supergrid graphextending supergrid graphindependent restrained domination
Related Items (1)
Cites Work
- Hamiltonian cycles in linear-convex supergrid graphs
- The Hamiltonian properties of supergrid graphs
- Unit disk graphs
- Restrained domination in graphs
- The Hamiltonian connectivity of rectangular supergrid graphs
- The Domination Number of Grids
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Hamilton Paths in Grid Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The restrained domination and independent restrained domination in extending supergrid graphs