Scribd
Upload
7 views4 pages

Study Material-2

The document discusses concepts related to graph theory, including Euler trails, Euler circuits, Hamiltonian paths, and cycles, as well as planar graphs and homeomorphic graphs. It also covers Euler's formula for planar graphs, vertex coloring, and the four color theorem, concluding with a proof that every tree with two or more vertices is 2-chromatic. Key definitions and properties of various types of graphs are provided throughout the material.

Uploaded by

8dncsbeats1234
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views4 pages

Study Material-2

The document discusses concepts related to graph theory, including Euler trails, Euler circuits, Hamiltonian paths, and cycles, as well as planar graphs and homeomorphic graphs. It also covers Euler's formula for planar graphs, vertex coloring, and the four color theorem, concluding with a proof that every tree with two or more vertices is 2-chromatic. Key definitions and properties of various types of graphs are provided throughout the material.

Uploaded by

8dncsbeats1234
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

STUDY MATERIAL-2

Euler Trail

A Euler trail of a connected graph G is an open trail of G containing all the edges of G

• A connected graph has a Euler trail if and only if it has exactly two vertices of odd degree.

Euler Circuit

A Euler circuit of a connected graph G is a circuit of G containing all the edges of G

• A connected graph that contains a Euler circuit is called as Eulerian graph

• A connected graph with at least two vertices has a Euler circuit if and only if each of its
vertices have even degree.

Hamiltonian path

A path in a graph G that contains every vertex of G is called Hamiltonian path

Hamiltonian Cycle

A cycle in a graph G that contains every vertex of G is called Hamiltonian cycle

A graph that contains Hamiltonian cycle is called as Hamiltonian graph

Graph Euler trail Euler circuit Hamilton path Hamilton cycle


NO NO
NO NO NO
NO NO
NO

A Planar graph is a graph that can be drawn in the plane such that no two edges intersect.
Here is planar graph

Here is not a planar graph

Homeomorphic graphs

Two graphs G1 and G2 are said to be homeomorphic if one of them is obtained from the other by
the process of (i) insertion of new vertices of degrees two into its edges or (ii) the merger of edges in
series

Kuratowski's theorem

A graph is planar if and only if has no subgraph homeomorphic to or .

Euler’s formula

Statement: Let G be a planar graph with and denote respectively the number of vertices,
edges and regions of G, then

In the above graph we have (no of regions)

Proof: Given G is a connected graph and and denote respectively the number of vertices,
edges and regions of G, then

We prove this by using induction method. Let us assume that

is true.

Let . Then n must be one and r must be 1.

So by our assumption

Therefore we can say that , the assumption is true for .


Let us assume that the above formula is true for then we get

Now we need to check for .

Let is a graph with vertices and regions.

Case 1:

Let has no cycle then the number of vertices in must be one more than the number of
edges in and there will be only one region exist so

From equation (1)

Therefore, equation (1) is true for this case.

Case 2:

Let has cycle. Now we delete one edge from any cycle of then we have vertices,
edges, regions. Therefore, from equation (1)

Therefore, equation (1) is true for this case.

Hence, if and denote the number of vertices, edges and regions of planar graph G, then

Vertex colouring:

A proper vertex colouring of a graph G is an assignment of colours to the vertices of G such that
every 2 adjacent vertices must receive different colours.

A k-colouring of a graph G is the colouring of G with k colours.

If G has k-colouring then we say it is k-colourable.

Four color theorem: Every simple, connected planar graph is 4-colorable.

Chromatic number

A chromatic number of a graph is the least number of colors needed for a proper coloring of the
given graph. The chromatic number of a graph is denoted by .
Here the chromatic number is 5

1. A Null graph is 1-chromatic

2. If G is graph with n vertices then

3. For a complete graph

4. For a bipartite graph

5. For a path

6. For a cycle or 3

Note: A tree is a simple connected graph with no cycles.

There is one and only one path between any two vertices in tree.

Prove that every tree with two or more vertices is 2-chromatic.

Proof: Let T is a tree. Select any vertex v in T. Let T is rooted at v. Let v is coloured with colour 1.

Let the adjacent of v is coloured with coloured with colour 2. Let the adjacent of these vertices be
colour 1 and we continue this process till every vertex T has been coloured.

Now in T we find all the vertices at odd distances from v have colour 2, while v and vertices at even
distances from v have colour 1. Since There is one and only one path between any two vertices in
tree, no two adjacent vertices have the same colour. Thus T has been properly coloured with two
colours. So every tree with two or more vertices is 2-chromatic.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy