11 views

Uploaded by vk100

ghgh

- Eklavya Jan-mar 2011
- Facility Layout
- Super Fibonacci Graceful Labeling of Some Special Class of Graphs
- PSNTP Paper 2
- Calculating minimum edit distance
- Facility Layout
- 00-Table of Contents
- Operations on Interval Valued Neutrosophic Graphs
- Error Due to Diaphragm Constraint
- Solve
- Erick Lin (Middle)
- hw3_sol
- Energy Efficient Power Failure Diagonisis For Wireless Network Using Random Graph Theory
- Design Facility Layout
- Bucket Brigade
- CTU SG310
- Business Object
- 1893436-AQA-MD02-QP-JUN14.pdf
- How to Add New Dynamic Pairs to an Existing Device Group in SRDF
- No4

You are on page 1of 5

-Rhishikesh

Graph Theory:

Graph theory can be defined as the study of graphs;

Graphs are mathematical structures used to model pair-wise relations between objects

from a certain collection. Graph can be defined a set V of vertices and set of edges.

Where, V is collection of |V| = n abstract data types. Vertices can be any abstract data

types and can be presented with the points in the plane. These abstract data types are also

called nodes. A line (line segment) connecting these nodes is called an edge. Again, more

abstractly saying, edge can be an abstract data type that shows relation between the nodes

(which again can be an abstract data types).

In this document, I would briefly go over through how and what led to the development

of the graph theory which revolutionized the way many complicated problems were

looked at and were solved.

Leonhard Paul Euler (1707- 1783) was a pioneering Swiss mathematician, who spent

most of his life in Russia and Germany. Euler (pronounced as OILER) solved the first

problem using graph theory and thereby led the foundation of very vast and important

field of graph theory. He created first graph to simulate a real time place and situation to

solve a problem which was then considered one of the toughest problems.

Problem

The Knigsberg bridge problem originated in the city of Knigsberg, formerly in

Germany but, now known as Kaliningrad and part of Russia, located on the river Preger.

The city had seven bridges, which connected two islands with the main-land via seven

bridges. People staying there always wondered whether was there any way to walk over

all the bridges once and only once. The below picture is the map of Knigsberg during

Euler's time showing the actual layout of the seven bridges, highlighting the river Preger

and the bridges.

Fig. 1

In, 1736 Euler came out with the solution in terms of graph theory. He proved that it was

not possible to walk through the seven bridges exactly one time. In coming to this

conclusion, Euler formulated the problem in terms of graph theory. He abstracted the

case of Knigsberg by eliminating all unnecessary features. He drew a picture consisting

of dots that represented the landmasses and the line-segments representing the bridges

that connected those land masses. The resulting picture might have looked somewhat

similar to the figure shown below.

Fig. 2

This simplifies the problem to great extent. Now, the problem can be merely seen as the

way of tracing the graph with a pencil without actually lifting it. One can try it in all

possible ways, but you will soon figure out, it is not possible. But Euler not only proved

that its not possible, but also explained why it is not and what should be the characteristic

of the graphs, so that its edge could be traversed exactly once. He came out with the then

new concept of degree of nodes. The Degree of Node can be defined as the number of

edges touching a given node. Euler proposed that any given graph can be traversed with

each edge traversed exactly once if and only if it had, zero or exactly two nodes with odd

degrees. The graph following this condition is called, Eulerian circuit or path. We can

easily infer this theorem. Exactly two nodes are, (and must be) starting and end of your

trip. If it has even nodes than we can easily come and leave the node without repeating

the edge twice or more.

In actual case of seven bridges of Knigsberg, once the situation was presented in terms

of graph, the case was simplified as the graph had just 4 nodes, with each node having

odd degree. So, Euler concluded that these bridges cannot be traversed exactly once.

Using this theorem, we can create and solve number of problems. Suppose now, we want

to make the graph created from bridges of Knigsberg, a Eulers circuit. Now, as per

Eulers theorem we need to introduce a path to make the degree of two nodes even. And

other two nodes can be of odd degree out of which one has to be starting and other

another the endpoint. Suppose we want to start our journey from blue node and end at the

yellow node. So, the two nodes can have odd edges. But somehow we need to edit the

actual graph by adding another edge to the graph such that the two other nodes have even

degree. So, the resulting figure is shown below.

Fig. 3

http://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg

Bibliography

http://mathforum.org/isaac/problems/bridges2.html

http://www-history.mcs.st-andrews.ac.uk/Biographies/Euler.html

http://scienceworld.wolfram.com/biography/Euler.html

http://www.jcu.edu/math/vignettes/bridges.htm

An Inside Guide To Algorithms: by Siegel and Cole

- Eklavya Jan-mar 2011Uploaded byarhennian
- Facility LayoutUploaded byAsif Raza
- Super Fibonacci Graceful Labeling of Some Special Class of GraphsUploaded byMia Amalia
- PSNTP Paper 2Uploaded bymdthelio
- Calculating minimum edit distanceUploaded byubunturulz
- Facility LayoutUploaded by777veena777
- 00-Table of ContentsUploaded byJasdeep
- Operations on Interval Valued Neutrosophic GraphsUploaded byAnonymous 0U9j6BLllB
- Error Due to Diaphragm ConstraintUploaded byChandeshwor Shah
- SolveUploaded bySamin Afnan
- Erick Lin (Middle)Uploaded byYoyo Kirby2
- hw3_solUploaded bySubhajit Chatterjee
- Energy Efficient Power Failure Diagonisis For Wireless Network Using Random Graph TheoryUploaded byidescitation
- Design Facility LayoutUploaded bypakoffi
- Bucket BrigadeUploaded byaattish
- CTU SG310Uploaded byJohannes Camasura
- Business ObjectUploaded byFlavio Dos Reis
- 1893436-AQA-MD02-QP-JUN14.pdfUploaded byastargroup
- How to Add New Dynamic Pairs to an Existing Device Group in SRDFUploaded byTimothy Sage
- No4Uploaded bySMP Negeri 2 Karawang Barat
- 10-PIDControlKnospeUploaded byCintia Kagueyama
- week0Uploaded byTerbinderGill
- Roman Primary and Auxiliary Domination Number of a GraphUploaded byJASH MATHEW
- Alphabet Series TricksUploaded byAnonymous 11TijG2a
- D.calls ListUploaded byDave
- Lecture 1Uploaded byPaul Wilker Landaeta Flores
- Schematic of 4 way Set Associative cache with LRUUploaded byVishakh
- 6 SensitivityUploaded byhatemakeedy1969
- Universal Groups in Server 2003Uploaded byprasadb83
- Handover II AlgorithmUploaded byHazem Ahmed Maher

- NoticeUploaded byvk100
- Civil Event Details-shodh2018Uploaded byvk100
- TRTI Notification.pdfUploaded byvk100
- 2017 Monthly CalendarUploaded byMuhamad Asri
- Muncipal Paper 2018Uploaded byvk100
- Pert Chart Potrait 12Uploaded byvk100
- RAT SpecimenTestPaperUploaded byPrasad Krishnamurthy
- Bunglow ProjectUploaded byvk100
- Copy of Copy of Two Peg Results Y1 App MonUploaded byvk100
- Planning of CityUploaded byMd.imthiyaz
- MSRTCUploaded byvk100
- JSA PlansheetUploaded byvk100
- New Microsoft Office Excel WorksheetUploaded bymarissa_
- Se-civil Sem3 Bmc Dec17Uploaded byvk100
- Naac 17 IndexUploaded byvk100
- Paper191257-1263Uploaded byvk100
- Studies on Treatment of Low-strength Effluents by UASB Reactor and Its ApplicationUploaded byadaneshi
- 2017 Monthly CalendarUploaded byMuhamad Asri
- Micro ManUploaded byvk100
- Mission Rajyaseva 2016 - How to Study_ - Mission MPSCUploaded byvk100
- Auto Cad ListUploaded byvk100
- SYFile82Uploaded byDilip Matolkar
- CESA LetterUploaded byvk100
- CE ESE Objective Volume-1 (2017)Uploaded byvk100
- ijens-1117-hatwarUploaded byvk100
- SYFile91Uploaded byvk100
- Capr i En6273Uploaded byvk100
- LABMANULUploaded byvk100
- DAiry-19Uploaded byvk100
- HHAMShUploaded byvk100

- data processing and analysis of dataUploaded byankita3031
- Sociology MainsUploaded byKeshav Prasad
- booklet.pdfUploaded bySri Rahayu Mardiah Kusuma
- 101_2018_3_bUploaded byworship
- TYPES OF RESEARCH METHODSUploaded byapi-3699361
- APA Sample Summary for ttest.docUploaded bykenny chee
- Efficient Randomized Algorithms for the Repeated Median Line EstimatorUploaded bydogajunk
- Molecular Red ReaderUploaded bySvebor Midzic
- Lecture 2 - 11. One advantage of exponential smoothing is the limited amount of record keeping involved.Uploaded byqamarbangash
- StudyUploaded byAnonymous L3W8LlpMPW
- Iran in the Ancient EastUploaded byAshBarlow
- Related StudiesUploaded byMonster Bebe
- Growing Our Herbal IndustryUploaded byAlvin Tung Kwong Choong
- Booklet 2014Uploaded byvivekananda
- Policy Advocacy and Engagement Training-Post Evaluation Report - Accra Ghana (November, 2010)Uploaded bywacsi
- y10 hpea unit planUploaded byapi-349695022
- professionalism b wc analysis vs summaryUploaded byapi-246209162
- Coherence in the assessment of writing skills.pdfUploaded bykayta2012
- Ansys Asas BrochureUploaded byTomás Campoverde
- Background and Literature OverviewUploaded byAima Iman
- Cost Effectiveness AnalysisUploaded byYash Sharma
- Annotated BibUploaded bymlisiawilliams
- Effects of Inventory Management Practices on an OrganizationUploaded byMahbubul Haque Shuvo
- AIM PresentationUploaded byMarwa Ghoz
- 9- The Marker_s DilemmaUploaded byCarlos Aguayo
- Chaomei Chen (Auth.) Mapping Scientific Frontiers_ the Quest for Knowledge Visualization 2013Uploaded byprocopiodelllano
- The Underestimated Cost of the Opioid CrisisUploaded byShira Schoenberg
- dematel 2Uploaded bykevin
- BucklingUploaded byAlma Rosa García
- Attentional Capture by Working Memory ContentsUploaded byPauljohn Enriquez