A characterization of independent domination critical graphs with a cutvertex
From MaRDI portal
Publication:2809944
zbMATH Open1342.05096MaRDI QIDQ2809944FDOQ2809944
Authors: N. Ananchuen, W. Ananchuen 
Publication date: 30 May 2016
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Recommendations
- On minimum cutsets in independent domination vertex critical graphs
- Connected domination critical graphs with cut vertices
- Graph critical with respect to independent domination
- Some results on the independence number of connected domination critical graphs
- scientific article; zbMATH DE number 1439459
- A constructive characterization of total domination vertex critical graphs
- scientific article; zbMATH DE number 881277
- Edge Cut Domination, Irredundance, and Independence in Graphs
- A note on independent vertex-edge domination in graphs
- scientific article; zbMATH DE number 6096635
Cited In (8)
- Color-critical graphs with independent cutset
- Strongly \(i\)-bicritical graphs
- A polynomial algorithm for the extendability problem in bipartite graphs
- On minimum cutsets in independent domination vertex critical graphs
- Some toughness results in independent domination critical graphs
- Graph critical with respect to independent domination
- On independent domination critical graphs and \(k\)-factor critical.
- A characterization of \(3\)-\(i\)-critical graphs of connectivity two
This page was built for publication: A characterization of independent domination critical graphs with a cutvertex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809944)
