Distance domination-critical graphs
From MaRDI portal
Publication:2483152
DOI10.1016/J.AML.2007.05.013zbMATH Open1145.05045OpenAlexW2028343507MaRDI QIDQ2483152FDOQ2483152
Authors: Fang Tian, Jun-Ming Xu
Publication date: 28 April 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.05.013
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Application of Graphs
- Vertex domination-critical graphs
- The diameter of domination k‐critical graphs
- Domination critical graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Vertex domination‐critical graphs
- Title not available (Why is that?)
Cited In (11)
- The diameter of domination k‐critical graphs
- On the distance domination number of bipartite graphs
- On the diameter of domination bicritical graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination game critical graphs
- Graph Domination in Distance Two
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total \(k\)-distance domination critical graphs
- On bondage numbers of graphs: a survey with some comments
This page was built for publication: Distance domination-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483152)