Presenters: presenters



Download 249.09 Kb.
Page1/9
Date20.07.2021
Size249.09 Kb.
  1   2   3   4   5   6   7   8   9

A Presentation On Graph Theory(continued)


TRIBHUVAN UNIVERSITY

Institute of Engineering

Thapathali Campus

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

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.

G1

a

b

e

d

c

G2

a

b

e

d

c

h

g

f

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