Characteristics of Non-Planar Graphs

The video tutorial explores the concept of planar graphs, which are graphs that can be drawn without any edges crossing. It examines five different graphs: K23, K33, K5, a graph of order 5 and size 8, and a graph of order 6 and size 12. The tutorial determines which of these graphs are planar by attempting to draw them without edge crossings. K23 is found to be planar, while K33 and K5 are not. The graph of order 5 and size 8 is planar, but the graph of order 6 and size 12 is not.

What is the main problem discussed in the video?

• Finding the shortest path in graphs

• Calculating the degree of vertices

• Determining if graphs are planar

• Checking if graphs are connected

What defines a planar graph?

• A graph with equal number of vertices and edges

• A graph with no loops

• A graph with no multiple edges

• A graph that can be drawn without edge crossings

How can some non-planar graphs be converted into planar graphs?

• By adding more vertices

• By increasing the graph's size

• By removing edges

• By redrawing edges to avoid crossings

What is the significance of edge crossings in determining if a graph is planar?

• They increase the graph's size

• They make the graph non-planar

• They reduce the graph's order

• They make the graph complete

Which of the following is true about K23?

• It is a non-planar graph

• It is a complete graph

• It is a planar graph

• It has more edges than vertices

What is the main feature of a complete bipartite graph?

• It has no edges

• Vertices are divided into two sets with edges only between sets

• All vertices are connected to each other

• It has loops

What is the main feature of K23?

• It is disconnected

• It is complete

• It is non-planar

• It is planar

What is the main feature of a complete bipartite graph?

• Vertices are divided into two sets with edges only between sets

• It has no edges

• All vertices are connected to each other

• It has loops

What is the main feature of K23?

• It is planar

• It is non-planar

• It is disconnected

• It is complete

What is the main feature of a complete bipartite graph?

• It has no edges

• It has loops

• Vertices are divided into two sets with edges only between sets

• All vertices are connected to each other