Graph Theory Introduction

Which two vertices are adjacent vertices?

• 5 is adjacent to 6

• 3 is adjacent to 6

• 4 is adjacent to 1

• 3 is adjacent to 2

Tags

CCSS.6.G.A.4

Graphs that have directed edges are called

• multiple edges

• simple graphs

• digraphs

• trees

Two or more edges connecting the same two vertices

• Directed edges

• Adjacent edges

• Multiple edges

• Why do you do this to us?

An undirected, unweighted graph with no loops and no multiple edges.

• Simple graph

• Complete graph

• Undirected graph

• Bipartite graph

A selection of edges and vertices from a main graph

• Complete graph

• Simple graph

• Tree

• Subgraph

Which vertex has an even degree/order?

• A

• B

• C

• D

• E

Which of the statements below is not true

• V = {P, Q, R, S, T, U}

• E = {(R,S), (S,T), (T,U), (U,P), (P,Q)}

• d(R) = 3

• sum of degree = 18

Which of the following statements in not true?

• V={ P, Q, R, S, T, U}

• E= {(P,P), (P,R), (R,S), (S,T), (T,S), (R,Q), (Q,P)}

• d(P) = 3

• sum of degree = 14

A loop in a graph is ...

• A circle

• the edge - the two end-points of which are the same

• no edge incident with the point

• More than one edge between two points

The sum of degrees of the points in every graph is ...

• is an odd number

• Is an even number

• twice the number of edges

• the half of the number of edges