Critical graphs with respect to total domination and connected domination
From MaRDI portal
Publication:2820189
zbMATH Open1344.05107MaRDI QIDQ2820189FDOQ2820189
N. Ananchuen, P. Kaemawichanurat, Louis Caccetta
Publication date: 14 September 2016
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://ajc.maths.uq.edu.au//pdf/65/ajc_v65_p001.pdf
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cited In (19)
- Connected domination critical graphs with cut vertices
- Critical graphs with connected complements
- On the total domination critical graphs
- 2.5-connectivity: unique components, critical graphs, and applications
- On the existence problem of the total domination vertex critical graphs
- Some results on the independence number of connected domination critical graphs
- Connected Domination
- Title not available (Why is that?)
- Matching properties in connected domination critical graphs
- On total domination vertex critical graphs of high connectivity
- On an open problem concerning total domination critical graphs
- Title not available (Why is that?)
- The connectivity of domination dot-critical graphs with no critical vertices
- Title not available (Why is that?)
- Disconnected \(g_c\)-critical graphs
- On global domination critical graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of domination critical graphs
This page was built for publication: Critical graphs with respect to total domination and connected domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820189)
