Scribd
Upload
229 views

Worksheet VI (Graph Theory)

1) There are 30 edges in a graph with 10 vertices each with degree 6. 2) A bipartite graph has vertices that can be divided into two disjoint sets such that no two vertices within the same set are adjacent. A complete graph is a graph where every pair of distinct vertices is connected by a unique edge. A complete bipartite graph cannot be a complete graph. 3) The adjacency matrix represents connections between vertices in a graph. It shows which vertices are adjacent to each other with 1s and non-adjacent vertices with 0s.

Uploaded by

Babal Yepa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
229 views

Worksheet VI (Graph Theory)

1) There are 30 edges in a graph with 10 vertices each with degree 6. 2) A bipartite graph has vertices that can be divided into two disjoint sets such that no two vertices within the same set are adjacent. A complete graph is a graph where every pair of distinct vertices is connected by a unique edge. A complete bipartite graph cannot be a complete graph. 3) The adjacency matrix represents connections between vertices in a graph. It shows which vertices are adjacent to each other with 1s and non-adjacent vertices with 0s.

Uploaded by

Babal Yepa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DEFENCE UNIVERSITY

College of Engineering
Department of Basic Science and Humanities
Discrete Mathematics (Math 2022)
Worksheet-IV (Elements of Graph Theory) December, 2022
1. How many edges are there in a graph with 10 vertices each of degree six?
2. a) Give examples of bipartite graph and complete graph.
b) Can a complete bipartite graph be a complete graph? Give example.
3. Write out the adjacency matrix A(G) of the following graphs
i) v1 ii) a b

v2

v3

d c

4. Represent the Graphs bellow with an incidence Matrix and find degree of each Vertex.
v1 v2 e6 v3 e2
e7 e3 v1 v2
e1 e2 e4 e5 e1 e6 e3
e5
v4 v5 v4 e4 v3
5. Let G be undirected graph with adjacency matrix:

v1 v 2 v3 v 4
v1 0 2 0 1
A(G) = v 2 2 0 0 1 Then: Find
v3 0 0 0 0
v4 1 1 0 0
a) the degree of each vertex.
b) the cardinal number of the edge list.
c) Draw the graph.
0 1 0 0 1
1 0 0 1 0
6. If A(D)= 0 0 0 0 0 is the adjacency matrix of a diagraph D, then
1 0 0 0 0
[0 1 0 2 0]
a) Determine the in degree and out degree of each vertex.
b) Determine the total number of arcs in the diagraph.
c) Draw the graph.

Page 1 of 2
7. Find the Chromatic number of:
a) 𝐾4 ?
b) Complete bipartite graph 𝑲𝒎,𝒏 where 𝑚 &𝑛 are positive integers?
c) b e d) b e

G: a d g H: a d g

c f c f

8. Show that the graphs 𝐺 = (𝑉, 𝐸) and 𝐻 = (𝑊, 𝐹) given below are isomorphic.

u1 u2 v1 v2

u3 u4 v3 v4

G H

9. Use Welch – Powel algorithm to find X(G).

G: A1 A2 A3

A4 A5 A6

A7 A8

10. A tree has 4 vertices of degree 3 and 3 vertices of degree 2. The remaining vertices have
degree 1. Find the total no of vertices in the tree.

11. If 56 people sign up for a tennis tournament, how many matches will be played in the
tournament in order to identify the champion?

Page 2 of 2

You might also like