Scribd
Upload
7 views1 page

Assignment#2

The assignment requires definitions and examples of key graph terminologies such as vertex, edge, degree of a vertex, path, and cycle. It also asks for explanations of graph representations in computer memory using adjacency matrices and lists, and the differences between connectedness in directed and undirected graphs. Additionally, it seeks to distinguish between Euler and Hamiltonian paths with examples, and to determine if a path exists between two specified vertices in a given undirected graph.

Uploaded by

reggieblack2007
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
7 views1 page

Assignment#2

The assignment requires definitions and examples of key graph terminologies such as vertex, edge, degree of a vertex, path, and cycle. It also asks for explanations of graph representations in computer memory using adjacency matrices and lists, and the differences between connectedness in directed and undirected graphs. Additionally, it seeks to distinguish between Euler and Hamiltonian paths with examples, and to determine if a path exists between two specified vertices in a given undirected graph.

Uploaded by

reggieblack2007
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/ 1

Assignment#2 Deadline:12/5/2025

1. Define the following graph terminologies with examples:

• Vertex
• Edge
• Degree of a vertex
• Path
• Cycle

2. How can graphs be represented in computer memory? Explain with an example using:

• Adjacency Matrix
• Adjacency List

3. What is the difference between connectedness in directed and undirected graphs?


Provide a simple diagram for each.

4. What is the difference between an Euler path and a Hamiltonian path? Give one
example of each using a small graph.

5. Determine whether a path exists between vertex A and vertex D in the following
undirected graph:

Vertices: A, B, C, D
Edges: (A, B), (B, C), (C, D)

Does a path exist between vertex A and vertex D? If yes, list the path.

You might also like