Scribd
Upload
14 views2 pages

Asmt 01

This document is an assignment for the MA6230 Graph Theory course at IIT Madras, containing various problems related to graph theory concepts such as connectivity, trees, Eulerian tours, and properties of graphs. It includes proofs and definitions, as well as questions regarding the characteristics of specific types of graphs. The assignment emphasizes the understanding of connectedness, cycles, paths, and the relationships between different graph structures.

Uploaded by

Abhijith AS
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
14 views2 pages

Asmt 01

This document is an assignment for the MA6230 Graph Theory course at IIT Madras, containing various problems related to graph theory concepts such as connectivity, trees, Eulerian tours, and properties of graphs. It includes proofs and definitions, as well as questions regarding the characteristics of specific types of graphs. The assignment emphasizes the understanding of connectedness, cycles, paths, and the relationships between different graph structures.

Uploaded by

Abhijith AS
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/ 2

Department of Mathematics, IIT Madras

MA6230 Graph Theory


Assignment 1
A graph on n vertices, n > k is k-connected, if for every X ⊂ V , such that
|X| < k, the graph G \ X is connected.

1. Let G be a 2-connected graph. Prove that, for any two vertices u and v
in G, there exists an ordering u = v1 , v2 , v3 , . . . , vn = v of all the vertices
of G such that for every 1 ≤ i ≤ n − 1, the induced subgraphs H =
G[v1 , v2 , . . . , vi ] and H 0 = G[vi+1 , . . . , vn ] are both connected.
2. A 2-connected graph G is said to be minimally 2-connected, if for any edge
e, G \ e contains a cut-vertex. Show that if u and v are adjacent vertices
in such a graph, then G \ {u, v} is connected.

3. Prove that the following are equivalent for an n-vertex grapg T .


(a) T is a tree.
(b) T is connected and has no cycles.
(c) For u, v ∈ V (T ), T has exactly one u − v path.
(d) T is connected and has exactly n − 1 edges.
(e) T is connected, but T \ e is disconnected for every edge e.
(f) T has no cycle, but T + xy does, for any two non-adjacent vertices
x, y ∈ V (T ).
(g) T has n − 1 edges and no cycles.

4. Prove that a closed walk of odd length contains a cycle of odd length.
5. Prove that if a graph G has two paths of maximum length, they share at
least one common vertex.
6. Prove or disprove : Every graph contains two vertices of the same degree.

7. A graph is said to have an eulerian tour if there is a closed trail that


traverses every edge exactly once. Prove that a connected graph has an
eulerian tour if and only if every vertex is of even degree.
8. Define the following and give examples.

(a) cut-vertex.
(b) 3-connected graph.
(c) A forest; give an example with 4 components.
(d) A tree; give 3 examples with 8 leaves.
(e) A 3-partite graph; give an example with 8 vertices and 8 edges.

1
9. What is the maximum number of edges a bipartite graph on n vertices
can have? Prove.
10. Prove that every connected n-vertex graph; n ≥ 2 contains at least two
vertices that are not cut-vertices.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy