|
Alternative solution for konigsberg bridge problem through the concept of matching
|
|
| Author:
|
R.SAMPATH , K.SRINIVASAN, P.THARANIYA, P.ELUMALAI
|
| Abstract:
|
The role of this paper gives short notes about Konigsberg Bridge Problem. It is used to evaluate the process of calculating the Maximal Matching and Maximum Matching in the Graph of Konigsberg Bridge Problem. Here it analyzes the degree of the each vertex and the adjacency of the edges of the corresponding graph. It explains about the history of Konigsberg, the creation of Konigsberg Bridge Problem and the Euler Solution for Konigsberg Bridge Problem by the condition of traversable. Rules for traversable is also analyzed in this paper. It gives some idea to make the graph as traversable by the concept of Matching. It is used to find in which of the bridge is common used by the people at many times.
|
| Keyword:
|
Vertex, Connectivity, Graph, Maximum Matching, Maximal Matching, Eulerian Graph
|
| EOI:
|
-
|
| DOI:
|
https://doi.org/10.31838/ijpr/2021.13.01.053
|
| Download:
|
Request For Article
|
|
|