Graph Theory Quiz

Which of the following is a characteristic of planar graphs?

• Edges can cross

• Planar graphs have loops

• Edges do not cross

• Planar graphs have multiple connected components

A graph is called Eulerian if it has:

• A Hamiltonian cycle

• All even vertices

• All odd vertices

• A bipartite subgraph

Connectivity of a graph refers to:

• Property that determines whether all vertices are connected or not

• Property that determines whether all vertices have the same degree or not

• Property that determines whether all vertices are disconnected or not

• Property that determines whether all edges are connected or not

Graph isomorphism refers to:

• Determining whether two graphs are structurally identical or not.

• Determining whether two graphs have the same number of connected components.

• Determining whether two graphs have the same number of edges.

• Determining whether two graphs have the same number of vertices.

Which of the following is NOT a characteristic of planar graphs?

• Containment of K6 as a subgraph

• Containment of K2,2 as a subgraph

• Containment of K5 or K3,3 as a subgraph

• Containment of K4 as a subgraph

A graph is called Hamiltonian if it has:

• Bipartite graph

• Eulerian cycle

• Hamiltonian cycle

• Planar graph

label the parts of the graph

a

b

c

edge

face

vertex

Tags

CCSS.6.G.A.4

Simple graphs must have no ​ (a)   or ​ (b)  

• loops
• multiple edges
• be connected
• odd vertices
• even vertices

The number of vertices on a complete graph with x vertices is?

Mathematical Equivalence

ON

Tags

CCSS.6.EE.A.2A

Match the following

• graph

• 
• bipartite

• 
• network

• 
• directed

• 

Tags

CCSS.8.F.A.1

CCSS.HSF.IF.B.5