The total bondage number of grid graphs
From MaRDI portal
Publication:714029
DOI10.1016/j.dam.2012.06.012zbMath1252.05163arXiv1109.3929OpenAlexW1983148984MaRDI QIDQ714029
Fu-Tao Hu, You Lu, Jun-Ming Xu
Publication date: 19 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3929
Related Items (7)
Hamiltonian cycles in linear-convex supergrid graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Unnamed Item ⋮ NP-hardness of multiple bondage in graphs ⋮ The Hamiltonian properties of supergrid graphs ⋮ Bondage numbers of Mycielski graphs ⋮ Some classifications of graphs with respect to a set adjacency relation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the bondage and reinforcement problems
- The bondage numbers of graphs with small crossing numbers
- Restrained bondage in graphs
- A survey of selected recent results on total domination in graphs
- The bondage number of a graph
- Bounds on the bondage number of a graph
- New results about the bondage number of a graph
- Bondage number of planar graphs
- Total domination number of grid graphs
- Remarks on the bondage number of planar graphs
- The bondage and connectivity of a graph
- \(\alpha_k\)- and \(\gamma_k\)-stable graphs
- The bondage numbers and efficient dominations of vertex-transitive graphs
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- Total bondage number of a graph
- The bondage numbers of extended de Bruijn and Kautz digraphs
- On the bondage number of planar and directed graphs
- Bondage number of the discrete torus \(C_n\times C_4\)
- Total domination in graphs
- Theory and Application of Graphs
- Graphs with large total domination number
- THE BONDAGE NUMBER OF C3×Cn
This page was built for publication: The total bondage number of grid graphs
