Scribd
Upload
6 views1 page

Graph Theory 2024

The document is an assignment from IISER Pune on Graph Theory, consisting of 12 problems related to various concepts in graph theory, including vertex degrees, connectivity, Eulerian graphs, and Hamiltonian cycles. It challenges students to prove or disprove statements and solve specific graph-related scenarios. The problems range from theoretical proofs to practical applications in graph construction and connectivity.

Uploaded by

sdzSFG
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
6 views1 page

Graph Theory 2024

The document is an assignment from IISER Pune on Graph Theory, consisting of 12 problems related to various concepts in graph theory, including vertex degrees, connectivity, Eulerian graphs, and Hamiltonian cycles. It challenges students to prove or disprove statements and solve specific graph-related scenarios. The problems range from theoretical proofs to practical applications in graph construction and connectivity.

Uploaded by

sdzSFG
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/ 1

Graph Theory IISER Pune 2024

Assignment 1

1. G is a graph with n vertices and n + 1 edges. Prove that there exists at least one
vertex whose degree is no less than 3.

2. Prove that among n (n > 2) people, there are at least 2 persons, where the number
of their friends are the same.

3. There are 15 telephones in a town. Can we connect them so that each telephone is
connected with other 5 telephones?

4. There are 99 members in a club, and every member claims that he would play bridge
only with someone he knows. Each member knows at least other 67 members. Prove
that there must be 4 members who can play bridge together.

5. Prove or disprove:
(a) Every Eulerian bipartite graph has an even number of edges.
(b) Every Eulerian simple graph with an even number of vertices has an even number
of edges.

6. Let G be a bipartite graph with |X| = |Y | = n and the degree of every vertex is more
than n2 , then prove that G is Hamiltonian.

7. Is there a graph with degrees 3, 3, 3, 3, 5, 5, 5, 6, 6, 6, 6?

8. Let G be a connected graph. An edge e is called a cut-edge in G if G − e results in a


disconnected graph. If every vertex of G has even degree, then prove that G contains
no cut-edges.

9. Let G be a graph containing a cycle C, and assume that G contains a path of length
and vj (Where vi , vj ∈ V (C) of C . Show that G
at least k between two vertices vi √
contains a cycle of length at least k. Is this best possible?

10. In a class with 7 students, each student sends card to 3 other students. Is it possible
that each student receives cards from the same 3 students whom he/she has sent
cards to?

11. Given a graph G (where |V (G)| = n and n is sufficiently large) where all vertices have
their degree greater than 3n
4
, prove that G contains n8 disjoint Hamiltonian cycles.

12. *Give an example (if they exist) of a degree sequence σ such that any graph that
admits this sequence should necessarily be disconnected. What if we restrict the
sequence to have

• min degree atleast 3


• min degree atleast 2
• No bound on min degree

You might also like