A characterization of independent domination critical graphs with a cutvertex

zbMATH Open1342.05096MaRDI QIDQ2809944FDOQ2809944

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)

Cited In (4)

• Color-critical graphs with independent cutset
• A polynomial algorithm for the extendability problem in bipartite graphs
• A characterization of 3-i-critical graphs of connectivity two
• Some toughness results in independent domination critical graphs

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• A constructive characterization of total domination vertex critical graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Edge Cut Domination, Irredundance, and Independence in Graphs 👍 👎
• A note on independent vertex-edge domination in graphs 👍 👎
• Title not available (Why is that?) 👍 👎

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)