Number of neighbors

• Degree of a vertex

• Neighborhood

Parallel Edges

• Multiple edges between the same vertex

• Edges do not intersect

Tags

CCSS.6.G.A.3

Directed Edges

• {(a,b), (b,e), (e,a)}

• {{a,b}, {b,e}, {e,a}}

Unirected Edges

• {(a,b), (b,e), (e,a)}

• {{a,b}, {b,e}, {e,a}}

Simple Graph

• No parallel edges

• No self-loops

• No parallel edges or self-loops

Total Degree

• Sum of the degrees of all vertices

• Highest degree of the vertices

Neighbor or Adjacent Vertices

• Vertices that have an edge between them.

• No more than one vertex between them

Cycle

• The edges connect the vertices in a ring.

• Has one or more wheel graphs

Regular Graph

• All vertices have the same degree

• All vertices have degree 5 or less

Directed Edge

• 
•