A characterization of independent domination critical graphs with a cutvertex

MaRDI QIDQ2809944zbMATH OpenFDO

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)

zbMATH Keywords

criticalindependent dominationcutvertex

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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)

• On minimum cutsets in independent domination vertex critical graphs
• A polynomial algorithm for the extendability problem in bipartite graphs
• Some toughness results in independent domination critical graphs
• Color-critical graphs with independent cutset
• Graph critical with respect to independent domination
• A characterization of \(3\)-\(i\)-critical graphs of connectivity two
• On independent domination critical graphs and \(k\)-factor critical.
• Strongly \(i\)-bicritical graphs

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)