Components of a Graph (27/07/2021)

A graph, in mathematics, does not refer to the graphs of functions that you are shown in high school. Informally, a graph is a collection of points connected by lines. The way you would write this mathematically is G=(V, E), where V is the collection of points or vertices and E is the collection of lines or edges.

Def. A walk is a sequence of incident vertices and edges in a graph.

Def. A path is a walk with no repeating vertices.

Def. Two vertices are connected if there is a path in the graph that has them as endpoints.

Def. A component of a graph G is a connected subgraph of G that is not a proper subgraph of any other connected subgraph in G.

The above definition is a bit hard to swallow, but it means just what you would think; components are pieces of a graph.

I noticed something peculiar; let G_1 be the number of vertices, G_2 the number of edges, G_3 be the number of faces, etc, then the following is true:

Conjecture. The number of components in a simple graph is given by the alternating sum of G_i.

Comments

Popular posts from this blog

Introduction (25/07/2021)

Summer Reading (17/07/2021)

Computer Vision (31/07/2021)