A General Existence Theorem
If W is any subset of the vertex-set V (G) of a graph or multigraph G, we write G — W to denote the graph constructed by deleting from G all vertices in W and all edges touching then. One can discuss the components of G — W; they are either odd (have an odd number of vertices) or even. Let Φ G (W) denote the number of odd components of G — W.
KeywordsComplete Graph Regular Graph Edge U2V2 Stochastic Matrice Quadratic Inequality
Unable to display preview. Download preview PDF.