Scribd
Upload
173 views1 page

Learning Reinforcement 7

The document defines a graph G with vertices V(G)={a,b,c,d,e,f,g,h} and edges E(G)={ab,ac,af,bd,cd,cf,de,ef,fg}. It asks to identify properties of the graph including vertices incident to x, edges incident to a, vertices adjacent to d, and edges adjacent to y. It also provides the shortest path from b to g. The document asks if graph G is an Euler graph and finds that it is, since every vertex has an even degree. It then provides an Euler tour. The document presents two graphs, graph G and graph H, and determines that graph

Uploaded by

Sittie Ainna Acmed Unte
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
173 views1 page

Learning Reinforcement 7

The document defines a graph G with vertices V(G)={a,b,c,d,e,f,g,h} and edges E(G)={ab,ac,af,bd,cd,cf,de,ef,fg}. It asks to identify properties of the graph including vertices incident to x, edges incident to a, vertices adjacent to d, and edges adjacent to y. It also provides the shortest path from b to g. The document asks if graph G is an Euler graph and finds that it is, since every vertex has an even degree. It then provides an Euler tour. The document presents two graphs, graph G and graph H, and determines that graph

Uploaded by

Sittie Ainna Acmed Unte
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

LEARNING REINFORCEMENT 07

1.) Identify the following:

a.) V(G) V(G) = {a, b, c, d, e, f, g, h}


b.) Vertices incident to x {a, f}
c.) Edges incident to a {ab, ac, x = af}
d.) Vertices adjacent to d {b, c, e}
e.) Edges adjacent to y {ac, cf}
f.) p p=7
g.) E(G) {ab, ac, af = x, bd, cd = y, cd cf de, ef, eg, fg}
h.) Shortest path from b to g Path 1: b-ba-a-af-f-fg-g
Path 2: b-bd-d-de-e-eg-g

2.) Is the graph an Euler graph? Why or why not? If yes, find an Euler tour.

3.) Given the graphs shown below, determine which graph is Hamiltonian and for such graph, find a

The graph is a Euler graph because it


presented no vertices with odd
degree.
Hamilton cycle:
Graph G has a Hamilton path and does not possess a Hamilton Cycle; thus, graph G is not a
Hamilton graph.

Graph H neither possess a Hamilton graph nor Hamilton Cycle; thus, graph H is not a
Hamilton graph.

This study source was downloaded by 100000858382410 from CourseHero.com on 12-06-2022 09:06:52 GMT -06:00

https://www.coursehero.com/file/116173989/Learning-Reinforcement-7-converteddocx/
Powered by TCPDF (www.tcpdf.org)

You might also like