Scribd
Upload
130 views2 pages

Graph Theory and Algorithms Assignment 1: ×M Matrix. Consider A Graph G Whose Vertices Are The Entries

(1) This document contains 16 problems related to graph theory and algorithms. The problems cover topics like determining the number of vertices and edges in a graph, proving properties of regular graphs and connected graphs, constructing graphs with specific properties, and analyzing relationships between groups of people. (2) Several problems ask to prove statements about graphs meeting certain degree criteria, like having exactly two vertices of odd degree or a minimum degree of n-1/2. Other problems construct graphs with specific regularity or that avoid certain cycle structures. (3) The final questions involve analyzing groups of people and determining if there must be subsets that are all acquainted or non-acquainted, or placing limits on the number of

Uploaded by

Sanjoy Pandit
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
130 views2 pages

Graph Theory and Algorithms Assignment 1: ×M Matrix. Consider A Graph G Whose Vertices Are The Entries

(1) This document contains 16 problems related to graph theory and algorithms. The problems cover topics like determining the number of vertices and edges in a graph, proving properties of regular graphs and connected graphs, constructing graphs with specific properties, and analyzing relationships between groups of people. (2) Several problems ask to prove statements about graphs meeting certain degree criteria, like having exactly two vertices of odd degree or a minimum degree of n-1/2. Other problems construct graphs with specific regularity or that avoid certain cycle structures. (3) The final questions involve analyzing groups of people and determining if there must be subsets that are all acquainted or non-acquainted, or placing limits on the number of

Uploaded by

Sanjoy Pandit
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

Graph Theory and Algorithms

Assignment 1
(1) Let M = (aij ) be an n×m matrix. Consider a graph G whose vertices are the entries
of M and two vertices are adjacent if they lie in the same row or same column. Then

(a) Find the total number of vertices of G?


(b) Is G a regular graph? If yes, then find the degree of regularity.
(c) Find the total number of edges of G.

(2) In any group of n persons (n ≥ 3), show that there are at least two with the same
number of friends.

(3) Prove that if a graph has exactly two vertices of odd degree then there must be a
path in the graph joining them.

(4) Prove or disprove: (i) If every vertex of a simple graph G has degree 2 then G is a
cycle.
(ii) A closed trail with all its vertices of degree 2 is a cycle.

(5) If G is a simple graph with n vertices and the minimum degree δ(G) ≥ n−1
2
then
prove that G is connected.

(6) Show by means of an example that the condition δ(G) ≥ n−2


2
for a simple graph G,
need not imply that G is connected.

(7) Let G be a graph in which there is no pair of adjacent edges. What can you say
about the degrees of the vertices in G.

(8) Let G be a graph with n vertices and e edges. Let m be the smallest positive integer
such that m ≥ 2e
n
. Prove that G has a vertex of degree at least m.

(9) Let G be a graph with n vertices and exactly n − 1 edges. Prove that G has either
a pendant vertex or an isolated vertex.

(10) Prove that in a group of six people, there must be three people who are mutually
acquainted or three people who are mutually non-acquainted.
(n−k)(n−k+1)
(11) A simple graph with n vertices and k components can have at most 2
edges.

(12) Prove that if a simple graph G is not connected then its complement is connected.

(13) Prove that if v is a cut vertex of graph G then v is not a cut vertex of graph Gc .

1
(14) Let G be a simple graph with δ(G) ≥ k. Show that: (i) G contains a path of length
at least k.
(ii) If k ≥ 2 then G contains a cycle of length at least k + 1.

(15) Construct a simple 3-regular graph on 8 vertices that contains no cycle of length 3
(triangle free).

(16) Construct a simple 3-regular graph on 10 vertices that contains no induced C3 or


C4 .

You might also like