A General Existence Theorem

  • W. D. Wallis
Part of the Mathematics and Its Applications book series (MAIA, volume 390)

Abstract

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.

Keywords

Complete Graph Regular Graph Edge U2V2 Stochastic Matrice Quadratic Inequality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • W. D. Wallis
    • 1
  1. 1.Southern Illinois UniversityCarbondaleUSA

Personalised recommendations