Presenters: presenters
Download
249.09 Kb.
Page
3/9
Date
20.07.2021
Size
249.09 Kb.
1
2
3
4
5
6
7
8
9
Navigate this page:
the Town of Konigsbe rg
Eulerian Graph
Can we travel along the edges of a graph starting at a vertex and returning to it by traversing each edge of the graph exactly once?
This question an easily be answered simply by examining the degrees of the vertices of the graph.
Figure 1: The Seven Bridges of Konigsberg Figure 2:
Multigraph Model of
the Town of Konigsbe
rg
An Euler path is a path using every edge of graph G exactly once.
An Euler circuit is a circuit using every edge of the graph G exactly once.
An Euler path starts and ends at different vertices.
An Euler circuit starts and ends at the same vertex.
Download
249.09 Kb.
Share with your friends:
1
2
3
4
5
6
7
8
9
The database is protected by copyright ©ininet.org 2020
send message
Main page
united states
total number
vast majority
federal government
other side
next generation
supreme court
current state
information contained
executive director
national association
middle east
east coast
general assembly
private sector
west coast
same time
total amount
united nations
united kingdom
full range
soviet union
highest level
national academy
european union