Presenters: presenters

A Presentation On Graph Theory(continued)

PRESENTERS:

PRESENTERS:

• PALDEN SHERPA(072/BEX/325)
• PRABIN KUMAR SHRESTHA(072/BEX/326)
• PRIYANKA SHRESTHA(072/BEX/327)
• PUSHWANT RAI(072/BEX/328)
• RABIN KUMAR DHAMALA(072/BEX/329)

Sub Topics

• PLANARITY TESTING ALGORITHM
• EULERIAN GRAPH
• HAMILTONIAN GRAPH

Planarity Testing Algorithm

Planarity Testing Algorithm

Elementary Subdivisions and Homeomorphism:

Elementary Subdivisions and Homeomorphism:

• If a graph is planar, so will be any graph obtained by removing an edge say {u , v} and adding a new vertex ‘w’ together with the edges {u , w} and {w , v}. Such an operation is called an Elementary Subdivisions.
• The graphs that can be obtained from the same graph by a sequence of elementary subdivisions are called homeomorphic graphs. Hence, Homeomorphism.