Graph Theory

A graph G is a conceptual structure that consists of a set V of vertices and a set E of edges. Each edge in E joins two vertices in V. An edge between two vertices u and v is denoted by (u, v). For the graph G in Figure 1 V = {a, b, c, d, e, f } and E = {(a, b), (b, c), (c, d), (d, e), (e, a), (b, f ), (d, f ), (e, f)}, where each vertex is drawn by a small black circle and each edge is drawn by a line segment connecting the two vertices. Usually an object is represented by a vertex and a relationship between two objects is represented by an edge. Thus, a graph ...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles