Scribd
Upload
46 views

Chapter 7

This document contains questions about graph theory concepts including degrees of vertices, adjacency lists and matrices, number of edges, degree sequences, Euler paths and circuits, Hamilton circuits, shortest paths, planarity, chromatic number, trees, rooted trees, and spanning trees.

Uploaded by

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

Chapter 7

This document contains questions about graph theory concepts including degrees of vertices, adjacency lists and matrices, number of edges, degree sequences, Euler paths and circuits, Hamilton circuits, shortest paths, planarity, chromatic number, trees, rooted trees, and spanning trees.

Uploaded by

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

AQ010-3-1-MCFC Graph Theory

1. What are the degrees of the vertices in the graphs displayed below?

2. Use adjacency list and adjacency matrix to represent the graphs given below.

a b c

e d

3. How many edges are there in a graph with 10 vertices, each having degree six?

4. If a graph has 5 vertices, can each vertex have degree 3?

5. Draw a simple graph whose degree sequence is


(a) (2, 2, 2, 2, 3, 5) (b) (1, 2, 2, 2, 3, 4)

6. A simple graph has the degree sequence (1, 1, 2, 2, 2, 4).


(a) Find the number of edges of the graph.
(b) Does the graph have an Euler path? Explain.

7. Given an adjacency matrix of an undirected graph as follows.


0 1 0 1 0
1 0 1 1 1

0 1 0 1 1
 
1 1 1 0 0
0 1 1 0 0
Draw the undirected graph that represented by the matrix above and label the vertices from a to e. Is
there any Hamilton circuit exist in the graph? State the circuit if there is any.

Level 1 Asia Pacific University of Technology & Innovation Page 1 of 4


AQ010-3-1-MCFC Graph Theory

8. Determine whether the graph has an Euler circuit. If no Euler circuit exists, determine whether the
graph has an Euler path.

9. Determine whether the graph has a Hamilton circuit. If no Hamilton circuit exists, give an argument
to show why no such circuit exists.

10. Find the length of a shortest path between these pairs of vertices in the weighted graph.

(a) a and z
(b) a and d
(c) c and b

11. Determine whether the given graph is planar. If so, draw it so that no edges cross.
(a) (b)

Level 1 Asia Pacific University of Technology & Innovation Page 2 of 4


AQ010-3-1-MCFC Graph Theory

12. Find the chromatic number of the given graph.


(a) (b)

13. Which of these graphs are trees?

14. The figure below is a tree T.


a

b c d

e f g h j k
i

l o p q r
m n

s t

(a) Which vertex is the root ? u


(b) Which vertices are internal ?
(c) Which vertices are leaves ?
(d) Which vertices are children of j ?
(e) Which vertex is the parent of h ?
(f) Which vertices are siblings of o ?
(g) Which vertices are ancestors of m ?
(h) Which vertices are descendants of b ?
(i) Draw the subtree of the tree that rooted at
a) a b) c c) e

Level 1 Asia Pacific University of Technology & Innovation Page 3 of 4


AQ010-3-1-MCFC Graph Theory

15. In which order are the vertices of the ordered rooted tree visited using an
a) Preorder traversal
b) Inorder traversal
c) Postorder traversal

b c

d
e f g

i j k l
16. Find a spanning tree for the graph shown by removing edges in simple circuits.
(a) (b)

Level 1 Asia Pacific University of Technology & Innovation Page 4 of 4

You might also like