Scribd
Upload
158 views

Tutorial 13 Graphs

This document provides a tutorial on graphs, including exercises to determine graph types, represent graphs using adjacency lists and matrices, find connected components, Euler and Hamiltonian circuits/paths, and shortest paths. Students are asked to analyze, classify, represent and find various structural properties for a variety of graphs.

Uploaded by

KaKa
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
158 views

Tutorial 13 Graphs

This document provides a tutorial on graphs, including exercises to determine graph types, represent graphs using adjacency lists and matrices, find connected components, Euler and Hamiltonian circuits/paths, and shortest paths. Students are asked to analyze, classify, represent and find various structural properties for a variety of graphs.

Uploaded by

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

BITI 1213 Linear Algebra and Discrete Mathematics

Faculty of Information and Communications & Technology

Tutorial 13 Graphs

1. Determine whether the graph shown is a simple graph , a multigraph, a pseudograph, a directed
graph, or a directed multigraph.

2. Use an adjacency list to represent the given graphs:

3. Represent the graphs in exercise 2 with an adjacency matrix.


4. Draw a graph with the given adjacency matrix:
BITI 1213 Linear Algebra and Discrete Mathematics
Faculty of Information and Communications & Technology

5. Find the adjacency matrix of the given directed multigraph.

6. Determine whether the given graph is connected?

7. How many connected components does each of the graphs in exercise 7 have? For each graph
find its connected components.

8.Find the strongly connected components of each of these graphs.


BITI 1213 Linear Algebra and Discrete Mathematics
Faculty of Information and Communications & Technology

9. Determine whether the given graph has an euler circuit. Construct such a circuit when one
exists. If no euler circuit exists, determine whether the graph has an euler path and construct such
a path if one exists.

10. Determine whether the given graph has a Hamilton circuit. If it does, find such a circuit. If it
does not, give an argument to show why no such circuit exist.
BITI 1213 Linear Algebra and Discrete Mathematics
Faculty of Information and Communications & Technology

11. Find the length of a shortest path between a and z in the given weighted graph.

You might also like