Independent domination bicritical graphs

zbMATH Open1405.05134MaRDI QIDQ4622631FDOQ4622631

Authors: Michelle Edwards, Arthur S. Finbow, Gary MacGillivray, S. Nasserasr 

Publication date: 13 February 2019

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/72/ajc_v72_p446.pdf

Recommendations

• Independent domination bicritical graphs
• Bicritical domination
• On independent domination critical graphs and \(k\)-factor critical.
• Some toughness results in independent domination critical graphs
• scientific article; zbMATH DE number 881277

zbMATH Keywords

independent domination numberindependent dominating set

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On connected \((\gamma,k)\)-critical graphs
• Title not available (Why is that?)
• Independent domination in graphs: A survey and recent results
• Bicritical domination
• Characteristics of \((\gamma,3)\)-critical graphs
• Constructing connected bicritical graphs with edge-connectivity 2
• Vertex domination‐critical graphs
• Title not available (Why is that?)
• Construction of (\(\gamma, k\))-critical graphs
• On the diameter of domination bicritical graphs
• Independent domination bicritical graphs

Cited In (7)

• Independent domination bicritical graphs
• Strongly \(i\)-bicritical graphs
• On \(i^{-}\)-ER-critical graphs
• On \(i\)-minus-edge-removal-critical graphs
• On independent domination critical graphs and \(k\)-factor critical.
• Independent domination in bipartite cubic graphs
• A characterization of \(3\)-\(i\)-critical graphs of connectivity two

This page was built for publication: Independent domination bicritical graphs

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