Matching properties in domination critic
โ
Nawarat Ananchuen; Michael D. Plummer
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 244 KB
A graph G is said to be k--critical if the size of any minimum dominating set of vertices is k, but if any edge is added to G the resulting graph can be dominated with k -1 vertices. A graph G is factor-critical if G -v has a perfect matching for every vertex v โ V (G) and is bicritical if G -u -v h