Advertisement

Connectivity

  • L. R. Foulds
Part of the Universitext book series (UTX)

Abstract

One of the most important graph theoretic concepts is that of connectivity We now introduce some of the ideas concerned with this aspect of graph structure. A walk in a graph G, is a sequence of vertices and edges of G of the form: \(\left\langle {{v_1},\left\{ {{v_1},{v_2}} \right\},{v_2},\left\{ {{v_2},{v_3}} \right\},{v_3}, \ldots ,{v_n} - 1,\left\{ {{v_n} - 1,{v_n}} \right\},{v_n}} \right\rangle .\)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • L. R. Foulds
    • 1
  1. 1.Department of Management SystemsUniversity of WaikatoHamiltonNew Zealand

Personalised recommendations