Maths-Assignment

Name:- Gautam Sharma

Scholar Number:- 21U03028

Department:- IT
Q.1 What is Graph?
- Graph can be defined as a pictorial representation or a diagram that
represent data or values in an organised way.
Or
- Graph can be defined as a
diagram which shows the
relation between
variable quantities, typically
of two variable, each
measured along one of
a pair of axes at 90 degree.

Q.2 What is simple graph?

- Simple graph is known as strict graph
- It is an unweighted, undirected graph containing no loops or
multiple
edges
- It can either be connected or disconnected
- In simple words, simple graph is a type of graph with no loops or no
parallel edges
Q.3 Write a short note on application of graph?
- Graph and graph theory is used in vast area of science and
technologies.
Some of them are:
i) In Computer Science:
• In Computer Science graph are used in the study of algorithms.
• Graphs are used to represent networks of communication and data
organisation
• Graph are used to define the flow of computation
ii) In Electrical Engineering:
• Used in designing of circuit connections known as topologies
iii) In Mathematics:
• In Maths, operational research is the important field. Graph theory
provides many useful applications in operational research like
minimum cost path and scheduling problems
iv) In Physics and Chemistry:
• Graph theory is used to study molecules
• In studying about atoms structure in 3D
• Statistical physics also uses graph
v) In Computer Network
• Graphs are used in network security
• The relationship among interconnected computer within network
follow principles of graph theory
Q.4 Define the following terms with examples in graph
- 1. Finite and infinite graph:
Finite graph: A graph is said to
be finite if it has finite number
of
edges and finite number of
vertices.
Infinite Graph: A graph Is said
to be infinite if it has infinite
number of
vertices and infinite number of edges.

- 2. Incidence and degree:

▪ In graph theory, the degree of a vertex is the number of edges
incident to the vertex, with loop counted twice. The degree of a
vertex is denoted by deg(v).
▪ The maximum degree of a graph (G), denoted by ΔG and the
minimum degree of a graph, denoted by 𝛿G are the maximum and
minimum degree of the vertices.
▪ In one more generalised notion, E is a set together with relation of
incidence that associates with each
edge, two vertices.
- 3. Isolated and pendant vertex:
▪ Isolated Vertex is a vertex with degree zero. I.e. a vertex that is not
an end point of any edge
▪ Pendant vertex is a vertex with degree = 1
- 4. Paths and circuits:
▪ Path is a route along edges starting at a vertex and ending at
another vertex
▪ Circuit is a path that begins and ends at the same vertex
- 5. Isomorphism:
▪ A graph can exist in different forms having same number of
vertices, edges and also the same edge connectivity. Such graph are
known as Isomorphs.
- 6. Subgraph:
▪ A subgraph of a graph G is a graph whose vertex set V(s) is a subset
of vertex set V(G), that is V(S) <= V(G) and whose edges set E(S) is a
subset of the edge set E(G), I.e. E(S) <= E(G).
Q.5 Define walks, paths and circuits with examples in graph.
- Walks: A finite length attenuating sequence of vertices and edges.
The
total numbers of edges covered in walk is known as length of walk.
- Paths: A path is defined as an closed walk in which neither vertices
nor
edges are allowed to repeat
- Circuit: A circuit can be defined as a closed walk in which vertices
may
repeat but edges are not allowed to repeat
Q.6 Differentiate between connected and disconnected
graph.
- A graph is connected if any two vertices of the graph are connected
by a
graph
- A Graph is disconnected if at least two vertices of the graph are not
connected by a path
- If a graph G is disconnected, then every maximal connected
subgraph of
G is called a connected component of the graph.

Q.7 Define Euler graph and Euler Path with example

- Euler graph is a connected graph which have a closed trail which
includes every edge of the graph.
- Any graph is called Euler if and only if all its vertices are of even
degree.
- Euler path is a trail in the connected graph that contains all the
edge of
the graph, then the trail is known as Euler Path or Euler Trail
Q.8 Write a short note on operation on graph
- Following are the basic graph operations in data structure
▪ Add/Remove Vertex
▪ Add/Remove edges
▪ Check if the graph contains a given value
▪ Find the path from one vertex to another
▪ Graph Union Revisited
▪ Graph complement and graph differences
▪ Graph joining
- Deletion of edge:

➢ If G(V,E) is a graph and e2E one of its edges, then G-e(V, Ee) is
subgraph of G-e(V, Ee)

- Addition of edges:
- Graph Join:

➢ Join of graph G and H denoted by GH and defined as follows

GH(Gc, tHc)c

Q.9 Define Hamiltonian paths and circuits with examples

- In the connected graph that
contains all the vertices of the
graph such
that walk visits every vertex of
the graph exactly once without
repeating
of edges, then such a path is
known as Hamilton Path.
Q.10 Define Tree in graph theory with 1,2,3,4,5 vertices
- A tree is an undirected graph G that satisfy any of the following
equivalent conditions
o G is connected and acyclic (contains no cyclic)
o G is acyclic and a simple cycle is formed if any edge is added to G
o G is connected and would become disconnected if any single edge
is
removed from G
o Any two vertices in G can be connected by a unique simple path
- Tree with One Vertex
▪ By definition, the one vertex and zero edge graph is a tree

- Tree with second Vertex

▪ Each Vertex has degree 1. This graph is having exactly one simple
path from one of these vertices to other

- Tree with Three Vertex

▪ From any three vertices in tree, the three paths between them
have
exactly one vertex in common known as median of three vertices
- Tree with Four Vertex
▪ Four vertices complete graph gives 16 spanning tress and only two
unlabelled trees

- Tree with Five Vertex

▪ 5 vertex and 4 edges and that any graph with 4 edges have 8
degree
as total degree so there are 5 possible vertices with degree 4

Q.11 Prove the theorem ‘Any connected graph with n vertex

and n-1 edges is a tree’.
- Let n be the number of vertices in a tree T
If n = 1, then the number of edges = 0
If n = 2, then the number of edges = 1
If n = 3, then the number of edges = 2
- We Know that the minimum number of edges required to make a
graph
of n vertices connected is (n – 1) edges
.
- We can observe removal of one edge from the graph. G will make it
disconnected . Thus a connected graph of n vertices and (n - 1) edges
cannot have a circuit. Hence, G is a tree
Q.12 Prove the theorem ‘Any connected graph with n
vertices and (n - 1) edges and no circuit is connected’
- Let the graph G is disconnected then there exist at least two
components
G1 and G2 say. Each of the component is circuit-less as G is circuit-
less
- Now to make a graph G connected we need to add one edge E
between
the vertices Vi and Vj, Vi is the vertex of Gi and Vj is the vertex of
component G2. Now the number of edges (n - 1) + 1 = n
- Now, G is connected graph and circuit-less with n vertices and n
edges
which is impossible because the connected circuit0kess graph is a
tree
and with n vertices and n-1 edges. So the graph G with vertices, (n -
1)
edges and without circuit is connected. Hence, the given statement is
proved
Q.13 Define rooted and Binary trees with examples
- A rooted tree is a tree in which one vertex has been designated the
root
I.e. it is a tree with special vertex labelled as the root of the tree
- A Binary tree is a tree data structure in which each node has at
most two

Q.14 What is Spanning tree?

- A spanning tree is a sub graph of
an undirected connected graph
which
includes all the vertices of the
graph with minimum possible
number of
edges.
Q.15 Define spanning tree in a weighted graph with example?
- Weighted graph is a graph in which edges or vertices are assigned
with a
weight/value. Example below
Q.16 Define – ‘Matrix representation of graph’
- A graph can be represented using adjacency matrix way. Adjacency
matrix A[v][v] is a 2-D array of size V x V where V is the number of
vertices
in a undirected graph.
- If there is an edge between Vx to Vy then the value of A[Vx][Vy] = 1
and
A[Vy][Vx] = 1, otherwise the value will be zero.
- For directed graph, if there is an edge between Vx to Vy, then the
value of
A[Vx][Vy] = 1 otherwise the value will be zero
- Adjacency Matrix of an undirected graph

- Adjacency of Directed graph

Q.17 Define – ‘Euler digraphs with example’

- A graph G is Eulerian if and only if it is connected and every vertex
has
even degree.
- A digraph is a directed graph which has not isolated vertices and
contains a Eulerian tour is called an Eulerian digraph. In Eulerian
digraph
every vertex has indegree equal to its outdegree.

Q.18 Define – incidence matrix and adjacency matrix with

example.
- There are two principal ways of representation of graph G with the
matrix I.e. adjacency and incidence matrix representation
- A) Representation of the undirected graph.
i) Adjacency Matrix Representation
- If an undirected graph G consists of n vertices then the adjacency
matrix of a graph is an n x n matrix A = [Aij] and defined by
ii) Incidence Matrix Representation
- If an undirected graph G consists of n vertices and m edges then
incidence matrix is an n x m matrix C = [Cij] and is defined by
Q.19 What is Directed graph? Explain.

- A Directed graph is a graph I.e. set of objects (called vertices or

nodes)
that are connected together, where tall the edges are directed from
one
vertex to another.

- A directed graph is sometimes called a digraph or a directed

network. In contrast, a graph where the edges are bidirectional is
called undirected graph

(Q17 and Q20 are same)

Q.21 Define -Incidence matrix and Adjacency matrix of a digraph
with example.

Representation of Directed graph:-

i) Adjacency Matrix Representation

- If a directed graph G consists of n vertices then the adjacency
matrix of a graph is an n x n matrix A = [Aij] and is defined by
ii) Incidence Matrix Representation
- If a directed graph G consists of n vertices and m edges, then the
incidence matrix is an n x m matrix C = [Cij] and is defined by