Scribd
Upload
21 views2 pages

Graph Colouring

Uploaded by

MOHAMMED ARHAM
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
21 views2 pages

Graph Colouring

Uploaded by

MOHAMMED ARHAM
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/ 2

Graph Colouring

Graph Colouring:
A graph colouring is an assignment of labels, called colours, to the vertices of a graph such
that no two adjacent vertices share the same colour.

• Associated a colour with each vertex of the graph is called vertex colouring.

Proper Vertex Colouring: Associated all the vertex of a graph with colours such that no
two adjacent vertices have the same colour is called proper vertex colouring.
Chromatic Number of Graph: The chromatic number of a graph G, denoted as χ(G), is the
minimum number of colours required to colour the vertices of a graph G in such a way that
no two adjacent vertices share the same colour. Formally, it is the smallest positive integer
k for which there exists a proper vertex colouring with k colours.

Question:

Question: How many unique colours will be required for proper vertex colouring of a line
graph having n vertices?

Question: What will be the chromatic number of the following graph?


(i)

(ii)

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