Scribd
Upload
33 views3 pages

GT Assignment I

This document outlines an assignment for a Graph Theory course, assigned on March 7, 2025, with a submission deadline of March 17, 2025. It includes a series of questions covering various concepts in graph theory such as definitions, properties, types of graphs, and proofs related to graphs. The assignment is intended for students in the Computer Science Engineering department at CBIT, Kolar.

Uploaded by

sindhubv512
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
33 views3 pages

GT Assignment I

This document outlines an assignment for a Graph Theory course, assigned on March 7, 2025, with a submission deadline of March 17, 2025. It includes a series of questions covering various concepts in graph theory such as definitions, properties, types of graphs, and proofs related to graphs. The assignment is intended for students in the Computer Science Engineering department at CBIT, Kolar.

Uploaded by

sindhubv512
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/ 3

ASSIGNMENT – I

Assigned on: 07.03.2025


Deadline for submission: 17.03.2025

Semester : IV Subject: Graph Theory Faculty Incharge:


Department : Computer Science (BCS405B) Dr. Chitra E.
Engineering Dept. of Mathematics
Section : A, B, C CBIT, Kolar

Questions:
1. Define (i) graph (ii) (𝑛, 𝑚) graph (iii) finite graph (iv) simple graph with examples.
2. Define (i) degree of vertex (ii) isolated vertex (iii) pendant vertex with example for each.
3. Consider the following graph.
(a) Mention the type of a graph.
(b) Find the pendant vertices of a graph.
(c) Find the minimum and maximum degrees of a graph.

4. Prove that in any graph 𝐺, the number of vertices of odd degree is always even.
5. Define (i) complete graph (ii) regular graph (iii) null graph with example for each.
6. Find the maximum number of edges in any graph with 𝑛 vertices.
7. Define cubic graph with examples. Draw all regular graphs with (a) 4 vertices
(b) 5 vertices.
8. For any (𝑛, 𝑚) graph 𝐺, prove that 𝛿(𝐺) ≤ ≤ ∆(𝐺).
9. Define isomorphism of graphs. Verify whether the following pair of graphs are
isomorphic or not.

1 Dr. Chitra E., CBIT, KOLAR


10. Draw all spanning subgraphs of 𝐾 .
11. Define (i) vertex disjoint subgraphs (ii) edge disjoint subgraphs with examples.
12. Define (a) walk (b) trail (c) circuit (d) path of a graph with example for each.
13. Determine the degrees of vertices of 𝑃 , 𝐶 , 𝐾 , 𝐾 , .
14. Define connected graph. Prove that a graph with 𝑛 vertices and 𝑘 components has at
( )( )
most edges.
15. Define bipartite graph. Verify whether the following graphs are bipartite or not.

16. Draw all complete bipartite graphs with 5 vertices. Calculate the number of vertices and
edges in 𝐾 , and 𝐾 , .
17. Draw the molecular graphs of methane, ethane and benzene. Draw a graph of Wheatstone
electrical network.
18. Define Euler graph. Prove that a graph is Euler graph if and only if all the vertices of it
are of even degree.
19. Show that the following graph is Euler graph and find the partition of its edges into
circuits.

20. Show that a connected graph 𝐺 has an Eulerian trail (unicursal line) if and only if there
are exactly two vertices of odd degree in 𝐺.
21. Define Hamiltonian graph. Draw a graph which has Hamiltonian path but does not have
Hamiltonian circuit.
22. Define Hamiltonian graph. Prove that in any complete graph with 𝑛 vertices there are
edge disjoint Hamiltonian circuits, if 𝑛 is an odd number ≥ 3.
23. Give an example of a graph which is Hamiltonian but not Euler graph. Draw a graph of
dodecahedron and find the Hamiltonian cycle in it.
24. Define union, intersection and ring sum of two graphs with examples.

2 Dr. Chitra E., CBIT, KOLAR


25. Find the in-degrees and out-degrees of the following digraph.

26. Prove that in any digraph the sum of the in-degrees of all the vertices is equal to the sum
of out-degrees; and this sum is equal to the number of edges in digraph.
27. Discuss about the types of digraphs with examples.
28. Draw a complete symmetric digraph and complete asymmetric digraph with 4 vertices.
29. Define binary relation. Represent the relation 𝑅 defined on 𝐴 = {2,3.4.6} by a “is a
divisor of ” in a digraph.

**********

3 Dr. Chitra E., CBIT, KOLAR

You might also like