Some toughness results in independent domination critical graphs

DOI10.7151/DMGT.1828MaRDI QIDQ891316zbMATH OpenOpenAlexFDO

Authors N. Ananchuen, W. Ananchuen

Publication date 17 November 2015

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1828

zbMATH Keywords

toughnessdomination critical

Mathematics Subject Classification ID

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

Recommendations

• A characterization of \(3\)-\(i\)-critical graphs of connectivity two
• A characterization of independent domination critical graphs with a cutvertex
• On minimum cutsets in independent domination vertex critical graphs
• On independent domination critical graphs and \(k\)-factor critical.
• Some results related to the toughness of 3-domination critical graphs. II

Cites work

• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A characterization of \(3\)-\(i\)-critical graphs of connectivity two
• A characterization of independent domination critical graphs with a cutvertex
• Domination critical graphs
• Structural Analysis of Complex Networks

Cited in

(4)

• Independent domination bicritical graphs
• On minimum cutsets in independent domination vertex critical graphs
• 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: Some toughness results in independent domination critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891316)