Scribd
Upload
29 views9 pages

Planar Graphs in Discrete Mathematics: Roll No: 22H51A05F3 Sec - A

Dm

Uploaded by

vignangudla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
29 views9 pages

Planar Graphs in Discrete Mathematics: Roll No: 22H51A05F3 Sec - A

Dm

Uploaded by

vignangudla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Planar Graphs In Discrete Mathematics

Roll no: 22H51A05F3


SEC - A
Introduction to Planar Graphs

Planar graphs are a fundamental


concept in discrete mathematics.

A planar graph is a graph that can be


embedded in the plane without any
edges crossing.

Planar graphs are useful in various


applications such as circuit design and
network topology.

1
Definition and Properties

A graph is planar if it can be drawn on


a plane without any edge crossings.

The Euler's formula for planar graphs


states that for any connected planar
graph, V -+ F = E + 2, where V is the
number of vertices, E is the number of
edges, and F is the number of faces.

Planar graphs can be characterized by


properties such as the number of
vertices, edges, and faces.

2
Dual Graphs

The dual graph of a planar graph is


obtained by assigning a vertex to
each face of the graph and connecting
vertices corresponding to adjacent
faces.

Dual graphs have properties that are


related to the original planar graph,
such as planarity and connectivity.

Studying dual graphs provides


insights into the structure and
properties of planar graphs.

4
Planar Embeddings

A planar embedding of a graph is a


specific way of drawing the graph on
the plane without edge crossings.

Planar embeddings can be used to


visualize the connectivity and
relationships between vertices and
edges in a planar graph.

Different planar embeddings of the


same graph can result in different
visual representations of the graph.

5
Coloring Planar Graphs

The Four Color Theorem states that


any planar graph can be colored with
at most four colors such that no two
adjacent vertices have the same color.

Coloring planar graphs is a


fundamental problem in graph theory
with applications in map coloring and
scheduling.

The Four Color Theorem has been


proven using advanced mathematical
techniques.

6
Applications of Planar Graphs

Planar graphs are used in various real-


world applications such as circuit
design, VLSI layout, and network
routing.

The concept of planar graphs is


essential in designing efficient and
optimal solutions for problems in
computer science and engineering.

Understanding planar graphs can lead


to improved algorithms for solving
complex problems.

7
Conclusion
● Planar graphs are a fundamental concept in discrete
mathematics with diverse applications and theoretical
significance.

● Studying planar graphs helps in understanding the structure


and properties of graphs in various contexts.

● Continued research and exploration of planar graphs


contribute to the advancement of mathematical theory and its
practical applications.

10
THANK YOU

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy