Theorems: Graph Theory

• The number of vertices of odd degree in a graph is always even

• The number of vertices of odd degree in a graph is always even
Proof:-
• If we consider the vertices with odd and even degrees separately,the quantity in LHS can be
expressed as the sum of two sums, each taken over vertices of even and odd degrees respectively

• Since the LHS is even

• First expression in RHS is a sum of even numbers, so it is also even
• Therefore, second expression must also be even
• A graph G is disconnected, iff its vertex set V can be partitioned into
two nonempty, disjoint subsets v1 and v2 such that there exists no
edge in G whose one end vertex is in subset v1 and the other in
subset v2
Theorem:
• A graph G is disconnected, iff its vertex set V can be partitioned into two
nonempty, disjoint subsets v1 and v2 such that there exists no edge in G
whose one end vertex is in subset v1 and the other in subset v2
• Proof: Proof by contradiction
• Suppose that such partition exists.
• Consider two arbitrary vertices a and b of G, such that
a ∈ v1 and b ∈ v2
• No path can exist between vertices a and b; otherwise, there would be
at least one edge, whose one end vertex would be in v1 and other in v2.
• Hence if a partition exists, G is not connected
Theorem 1: If a graph has exactly two vertices of
Odd degree there must be a path joining these
two vertices
Proof:

• Let G be a graph with all even vertices, except vertices v1 and v2

which are odd.
• Since we know that “The number of odd degree in a graph is always
even”
• Therefore, in graph G, vertices v1 and v2 must have a path between
them.
• A simple graph with n vertices and k components can have at most
(n-k)(n-k+1)/2 edges.
A simple graph with n vertices and k components
can have at most (n-k)(n-k+1)/2 edges.
Proof:
• Let the number of vertices in each of the k components of a graph G
be n1, n2, n3,…..,nk.
• Thus we have
n1 + n2 + n3 + …… + nk = n
• Now, the maximum number of edges in the ith component of G
(Which is a simple connected graph) is 𝑛𝑖 − 1 𝑛𝑖/2
• Therefore, maximum number of edges in G is:
1 𝑘 1 𝑛
σ𝑖=1 𝑛𝑖 − 1 𝑛𝑖 = σ𝑘𝑖=1 𝑛𝑖2 −
2 2 2
 1 1 𝑛
• σ𝑘𝑖=1 𝑛𝑖 − 1 𝑛𝑖 ≤ 𝑛2 − 𝑘 − 1 2𝑛 − 𝑘 − …from **
2 2 2
1
• ≤ 𝑛 − 𝑘 (𝑛 − 𝑘 + 1)
2
----………………………………………………………………………………………………….-----
• ** σ𝑘𝑖=1 𝑛𝑖 − 1 = 𝑛 − 𝑘
• Squaring both sides:
• (σ𝑘𝑖=1 𝑛𝑖 − 1 )2 = 𝑛 − 𝑘 2
• σ𝑘𝑖=1 𝑛𝑖2 − 2𝑛𝑖 + 𝑘 + 𝑛𝑜𝑛 𝑛𝑒𝑔𝑎𝑡𝑖𝑣𝑒 𝑐𝑟𝑜𝑠𝑠 𝑡𝑒𝑟𝑚s = n2 + k2 - 2nk
• σ𝑘𝑖=1 𝑛𝑖2 ≤ n2 + k2 - 2nk - k + 2n
• ≤ 𝑛2 − 𝑘 − 1 2𝑛 − 𝑘
• A given connected graph G is an Euler graph iff all vertices of G are of
even degree
A given connected graph G is an Euler graph
iff all vertices of G are of even degree
Proof:
• Suppose that G is an Euler graph (Edges can’t be repeated).
Therefore, contains a Euler line (Closed Walk).
• While tracing this walk, we observe that every time walk meets a
vertex v it goes through two new edges, incident on v (with one we
entered to v and with other exited from v)
• This is true for all the vertices including starting/ending vertex
• Thus if G is an Euler graph, the degree of every vertex is even
Euler’s Graphs
Unicursal graph
• In defining an Euler line, the walk should be closed.
• Open walk: a 1 c 2 d 3 a 4 b 5 d 6 e 7 b (graph shown in next slide)
Which includes all the edges of the graph and does not retrace any
edge, is not closed.
• The initial vertex is a and final vertex is b.
• We call such an open walk that includes all the edges of the graph
and does not retrace any edge, a unicursal line (or open Euler line).
• A connected graph that has a unicursal line will be called a unicursal
graph
Unicursal Graph
Unicursal line
• By adding an edge between the initial and final vertices of a unicursal
line we shall get an Euler line. Thus connected graph is unicursal iff it
has exactly two vertices of odd degree.
• Distance: In a connected graph G, the distance between two of its vertices
is the length of the shortest path (no. of edges between them).

• Eccentricity :The eccentricity of a vertex v in a graph G is the distance from

the vertex farthest from in G
• Center of graph: Vertex with minimum eccentricity in graph G is called a
center of G.
• Radius: The eccentricity of a center in a tree is defined as the radius of the
tree
• Diameter: The diameter of a tree T, is defined as the length of the longest
path in tree T.