Scribd
Upload
62 views

Graph Theory Assignment-4

Uploaded by

Manasi Sahukar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
62 views

Graph Theory Assignment-4

Uploaded by

Manasi Sahukar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

ASSIGNMENT-4

Graph theory and tree Descriptive Questions

1. State and prove the handshaking theorem.


2. What is meant by complement of a graph ? Characterize the complement
of each graph.
a. 𝐾𝑛
b. 𝐾𝑚,𝑛
c. 𝐶𝑛

3. What is a complete graph ? Give some examples. Find the number of


vertices, number of edges and degrees of each vertex.
4. Define subgraph of graph, the union of two graphs and intersection of two
graphs. For the following graph G, draw subgraphs 3 (i) G – e(deleting
edges) (ii) G - a (deleting vertices). What is
a. 𝐾5 ∪ 𝐾5 ′
b. 𝐾3,2 ∪ 𝐾3,2 ′
c. 𝐺 ∪ 𝐺′
d. 𝐺 ∩ 𝐺 ′ .
5. Define isomorphism. Explain the conditions for isomorphism. Determine
whether the following pair of graphs are isomorphic :

6. Define isomorphism. Give an example of two graphs that have the same
numbers of vertices, edges, and degrees of vertices, but that are not
isomorphic. How many simple non-isomorphic graphs are possible with 3
vertices.
7. Explain the conditions for isomorphism. How many simple non-isomorphic
graphs are possible with 4 vertices and 2 edges.
8. Determine whether the following graphs are isomorphic. If yes, justify your
answer.
9. What is an undirected graph ? Prove that an undirected graph has even
number vertices of odd degree.
10.What do you mean by isomorphic graphs ? Check whether the following
pair of graphs isomorphic graphs or not ?

11.What are the special types of graph and give the definition with example.

12.Define degree of the vertices of a graph. A simple graph G has 24 edges and
degree of each vertex is 4. Find the number of vertices.
13.Define Handshaking theorem. A graph contains 21 edges, 3 vertices of
degree 4 and all other vertices of degree 2. Find total number of vertices.
14.Define Handshaking theorem . A simple graph contains 35 edges, four
vertices of degree 5, five vertices of degree 4 and four vertices of degree 3.
Find the number of vertices with degree 2.
15.A graph has 24 edges and degree of each vertex is k, then what can you say
about the number of vertices ?
16.Determine if each graph is simple. (If No, give the proper reasons)
17.Find the number of vertices and edges of the graphs and the degrees
of the vertices of the graphs given below.
18.If it is possible to draw a graph, Find the number of edges of a graph that
has:
a. Exactly three vertices with degrees 1, 3, and 2.
b. Exactly five vertices with degrees 1, 1, 1, 1, and 4.
c. Three vertices with degrees 2, 3, and 4?
d. Four vertices with degrees 2, 2, 2, and 2?
19.Compute the number of edges in each complete graph.
a. 𝐾6
b. 𝐾7
c. 𝐾5,5
d. 𝐾10,19
20.Is each graph bipartite? If so, identify the vertex sets V1 and V2.

21.Find the number of vertices and number of edges in the bipartite


graph 𝐾𝑚,𝑛 . (Give proper reason )
22. Define regular graph. Can there be a 3-regular graph with five vertices?
Show for which value of n the complete graphs 𝐾𝑛 are regular.

23. Determine the number of vertices and edges and find the in-degree and
out-degree of each vertex for the given directed multigraph.
24.Determine the sum of the in-degrees of the vertices and the sum of the
out-degrees of the vertices of the following graphs. Show that they are
both equal to the number of edges in the graph.

25.For which values of n are these graphs bipartite?(Give proper reasons)


a) 𝐾𝑛
b) 𝐶𝑛
c) 𝑊𝑛
26.suppose a group of 4 people hosts a party and there are 7 guests at
the party. Everyone shakes hands with everybody else exactly once,
except that no host shakes hands with any other host. Draw the graph
model for this problem and count number of handshakes is possible in this
party.
27.Define complete graph. Show that for all integers n≥1, the number of edges
of 𝐾𝑛 is 𝑛(𝑛 − 1)/2.
28.Consider the following graph-

Decide which of the following sequences of vertices determine


walks. For those that are walks, decide whether it is a circuit, a
path, a cycle or a trail.
i. a,b,g,f,c,b
ii. b,g,f,c,b,g,a
iii. c,e,f,c
iv. c,e,f,c,e
v. a,b,f,a
vi. f,d,e,c,b
29. Consider the following graph-
Consider the following sequences of vertices and answer the questions
that follow-
a) x , v , y , w , v
b) x , u , x , u , x
c) x , u , v , y , x
d) x , v , y , w , v , u , x

a) Which of the above given sequences are directed walks?


b) What are the lengths of directed walks?
c) Which directed walks are also directed paths?
d) Which directed walks are also directed cycles?
30. Define the adjacency matrix representation of graphs (Directed and
Undirected graphs). Explain with an example for each case.
a. What is the sum of the entries in a row of the adjacency matrix
for an undirected graph? For a directed graph?
b. What is the sum of the entries in a column of the adjacency
matrix for an undirected graph? For a directed graph?
31.Define the incidence matrix representation of graphs (Directed and
Undirected graphs). Explain with an example for each case.
a. What is the sum of the entries in a row of the incidence matrix for an
undirected graph?
b. What is the sum of the entries in a column of the incidence matrix for an
undirected graph?
32. Define the following with examples
ii) Walk
iii) trail
iv) Path
v) Cycle
vi) Circuit.
33.Define connected and disconnected graph with examples. Is Konigsberg
bridge puzzle connected. Explain.
34. Define Euler path and Euler Circuit. What is the condition to have Euler
path or Euler circuit in a graph. Under what conditions will each graph
be Eulerian?
i) 𝐾𝑛
ii) 𝐾𝑚,𝑛
35. Define Hamiltonian path and Hamiltonian circuit. Check whether the
following graph is a Hamiltonian graph or not. Explain.
36. Under what conditions the graphs 𝐾𝑛 , 𝐾𝑚,𝑛 , 𝐶𝑛 , 𝑊𝑛 . State the Dirac’s
theorem and Ore’s theorem. Check the converse of these theorems are
true or not. If not give an example for justification.
37. Define Planar graph with one example. Explain whether the graphs 𝑘5 and
𝐾3,3 . Suppose that a connected planar simple graph has 20 vertices, each of
degree 3. Into how many regions does a representation of this planar graph
split the plane?
38.
a) State Kuratowski’s theorem on the planarity of graphs and explain
how it characterizes which graphs are planar.
b) What is Euler’s formula for connected planar graphs?How can Euler’s
formula for planar graphs be used to show that a simple graph is
nonplanar.
39. State the homeomorphism of two graphs and Kuratowski's theorem.
Check the planarity for the graph given below.

40.What is graph colouring. Discuss the applications of the graph coloring.


41.What do you mean by Chromatic number of a graph. Discuss the Chromatic
numbers for null graph, cycle graph, wheel graph, complete graph and
complete bipartite graph.
42.Define chromatic number of a graph. Find the chromatic numbers of the
following graphs.
a) Fig c) Fig
b) Fig d) Fig

43.
a) Define an Euler circuit and an Euler path in an undirected graph.Describe
the famous Königsberg bridge problem and explain how to rephrase it in
terms of an Euler circuit.
b) How can it be determined whether an undirected graph has an Euler path?
How can it be determined whether an undirected graph has an Euler
circuit?

44.a) Define a Hamilton circuit in a simple graph.


b)Give some properties of a simple graph that imply that it does not have a
Hamilton circuit

45. Define tree. Determine if each graph is a tree.

46.
a) Determine if the Petersen graph in Figure 8.28 is a tree.
If it isn't, explain why.
b) For what values of n is 𝐾𝑛 a tree? For what values of m
and 𝑛 is 𝐾𝑚 , 𝑛 a tree? For what values of 𝑛, an r-regular
graph be a tree with n vertices.
47. Define spanning trees of a graph. State and explain the Krushal’s
algorithm for a spanning tree with an example.
48.Define minimal spanning tree of the graph. State the Kruskal's algorithm
for minimal spanning tree and using this algorithm, construct a minimal
spanning tree for the following connected weighted graph.

You might also like