Scribd
Upload
107 views

Graphs Sheet

This document contains a chapter summary and list of exercises from a textbook on graph theory. It includes definitions of key graph theory concepts like vertices, edges, degree of vertices, isomorphism of graphs. It also lists exercises asking students to draw various graphs like trees, road networks, chemical structures. It asks students to analyze properties of graphs like their degree sequences, adjacency and incidence matrices. It introduces more advanced concepts like line graphs, automorphism groups and graph theory puzzles about configurations of people or objects. The exercises cover drawing, analyzing and proving properties of many different types of graphs.

Uploaded by

pspcpspc7
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
107 views

Graphs Sheet

This document contains a chapter summary and list of exercises from a textbook on graph theory. It includes definitions of key graph theory concepts like vertices, edges, degree of vertices, isomorphism of graphs. It also lists exercises asking students to draw various graphs like trees, road networks, chemical structures. It asks students to analyze properties of graphs like their degree sequences, adjacency and incidence matrices. It introduces more advanced concepts like line graphs, automorphism groups and graph theory puzzles about configurations of people or objects. The exercises cover drawing, analyzing and proving properties of many different types of graphs.

Uploaded by

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

Sheet 1

Chapter 1:
1.1 Write down the number of vertices, the number of edges, and
the degree of each vertex, in:
(i) the graph in Fig. 1.3;
(ii) the tree in Fig. 1.14.

1.2 Draw the graph representing the road system in Fig. 1.15, and
write down the number of vertices, the number of edges and the
degree of each vertex.
1.3s Figure 1.16 represents the chemical molecules of methane
(CH4) and propane (C3H8).
(i) Regarding these diagrams as graphs, what can you say about the
vertices representing carbon atoms (C) and hydrogen atoms (H)?
(ii) There are two different chemical molecules with formula C4H10.
Draw the graphs corresponding to these molecules.
1.4 Draw a graph corresponding to the family tree in Fig. 1.17.

1.5* Draw a graph with vertices A,. . . ,M that shows the various
routes one can take when tracing the Hampton Court maze in Fig.
1.18.
1.6s John likes Joan, Jean and Jane; Joe likes Jane and Joan; Jean
and Joan like each other. Draw a digraph illustrating these
relationships between John, Joan, Jean, Jane and Joe.

1.7 Snakes eat frogs and birds eat spiders; birds and spiders both
eat insects; frogs eat snails, spiders and insects. Draw a digraph
representing this predatory behaviour.
Chapter 2:

2.1s Write down the vertex set and edge set of each graph in Fig.
2.3.

2.2 Draw
(i) a simple graph,
(ii) a non-simple graph with no loops,
(iii) a non-simple graph with no multiple edges, each with five
vertices and eight edges.
2.3s
(i) By suitably labelling the vertices, show that the two graphs in Fig.
2.20 are isomorphic,
(ii) Explain why the two graphs in Fig. 2.21 are not isomorphic.
2.4 Classify the following statements as true or false:
(i) any two isomorphic graphs have the same degree sequence;
(ii) any two graphs with the same degree sequence are isomorphic.

2.5
(i) Show that there are exactly 2^n( n-1) / 2 labelled simple graphs
on n vertices,
(ii) How many of these have exactly m edges?

2.6s Locate each of the graphs in Fig. 2.22 in the table of Fig. 2.9.
2.7s Write down the degree sequence of each graph with four
vertices in Fig. 2.9, and verify that the handshaking lemma holds for
each graph.

2.8
(i) Draw a graph on six vertices with degree sequence (3, 3, 5, 5, 5,
5); does there exist a simple graph with these degrees?
(ii) How are your answers to part (i) changed if the degree sequence
is (2, 3,3,4,5, 5)?
2.9* If G is a simple graph with at least two vertices, prove that G
must contain two or more vertices of the same degree.

2.10s Which graphs in Fig. 2.23 are subgraphs of those in Fig. 2.20?
2.11 Let G be a graph with n vertices and m edges, and let v be a
vertex of G of degree k and e be an edge of G. How many vertices
and edges have G – e , G-v and G\e?

2.12s Write down the adjacency and incidence matrices of the


graph in Fig. 2.24.
2.13
(i) Draw the graph whose adjacency matrix is given in Fig. 2.25.
(ii) Draw the graph whose incidence matrix is given in Fig. 2.26.

2.14 If G is a graph without loops, what can you say about the sum
of the entries in
(i) any row or column of the adjacency matrix of G?
(ii) any row of the incidence matrix of G?
(iii) any column of the incidence matrix of G?

2.15* If G is a simple graph with edge-set E(G), the vector space of


G is the vector space over the field Z2 of integers modulo 2, whose
elements are subsets of E{G). The sum E + F of two subsets E and F
is the set of edges in E or F but not both, and scalar multiplication is
defined by 1.E = E and 0.E = ∅ . Show that this defines a vector space
over Z0, and find a basis for it.

3.1s Draw the following graphs:


(i) the null graph N5;
(ii) the complete graph K6;
(iii) the complete bipartite graph K7 4;
(iv) the union of Kl 3 and W4;
(v) the complement of the cycle graph C4.
3.2s How many edges has each of the following graphs:
(i)K10; (ii)K5,7; (iii) Q4; (iv) W8; (v) the Petersen graph?

3.6s Draw all the simple cubic graphs with at most 8 vertices.

3.7 The complete tripartite graph Kr,s,t consists of three sets of


vertices (of sizes r, s and t, with an edge joining two vertices if and
only if they lie in different sets. Draw the graphs K2,2,2 and K3,3,2
and find the number of edges of K3,4,5.
3.8 A simple graph that is isomorphic to its complement is self-
complementary.
(i) Prove that, if G is self-complementary, then G has 4k or 4k+1
vertices, where k is an integer,
(ii) Find all self-complementary graphs with 4 and 5 vertices,
(iii) Find a self-complementary graph with 8 vertices.

3.9* The line graph L(G) of a simple graph G is the graph whose
vertices are in one-one correspondence with the edges of G, two
vertices of L(G) being adjacent if and only if the corresponding edges
of G are adjacent,
(i) Show that K3 and K1,3 have the same line graph.
(ii) Show that the line graph of the tetrahedron graph is the
octahedron graph,
(iii) Prove that, if G is regular of degree k, then L(G) is regular of
degree 2k-2.
(iv) Find an expression for the number of edges of L(G) in terms of
the degrees of the vertices of G.
(v) Show that L(K5) is the complement of the Petersen graph.
3.10* An automorphism ʠ of a simple graph G is a one-one mapping
of the vertex set of G onto itself with the property that ʠ (v) and ʠ (w)
are adjacent whenever v and w are. The automorphism group T(G) of
G is the group of automorphisms of G under composition.
(i) Prove that the groups T(G) and T(G(bar)) are isomorphic,
(ii) Find the groups T(Kn), T(Kr,s) and T(Cn).
(iii) Use the results of parts (i) and (ii) and Exercise 3.9(v) to find the
automorphism group of the Petersen graph.
4.1s Find another solution of the eight circles problem.

4.2s Show that there is a gathering of five people in which there are
no three people who all know each other and no three people none
of whom knows either of the other two.

4.3s Find a solution of the four cubes problem for the set of cubes in
Fig. 4.12.
4.4 Show that the four cubes problem in Fig. 4.13 has no solution.

4.5* Prove that the solution of the four cubes problem in the text is
the only solution for that set of cubes.

You might also like