[go: up one dir, main page]
Scribd
Upload
35 views2 pages

PADAONG Assignment 3.2

The document contains a set of instructions for analyzing graphs, specifically focusing on determining the degree of each vertex and identifying the presence of Hamiltonian paths, Euler trails, and Euler circuits. It includes a request to document the findings for each graph presented. The document concludes with a note indicating that there are no Hamiltonian paths or Euler circuits in the provided graphs.

Uploaded by

Bata
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
35 views2 pages

PADAONG Assignment 3.2

The document contains a set of instructions for analyzing graphs, specifically focusing on determining the degree of each vertex and identifying the presence of Hamiltonian paths, Euler trails, and Euler circuits. It includes a request to document the findings for each graph presented. The document concludes with a note indicating that there are no Hamiltonian paths or Euler circuits in the provided graphs.

Uploaded by

Bata
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

NAME: Darious M.

Padaong 3BPED-B

For each of the graphs below,

1. Give the degree of each vertex.


2. Put a check if there is a (a) Hamiltonian path, (b) Euler trail, (c) Euler circuit, or
none of these.
3. If there is a Hamiltonian path, write it down (e.g., afcbde).
4 None of these

4 4

cabde
4 4

3
1
2 None of these

2 3
1
None of these

1 3 3 1

You might also like