Graph Equivalency

A graph G is an ordered pair G=(V,E) comprising:

• V, a set of vertices (also called nodes or points); and
• E, a set of edges (also called links or lines), which are 2-element subsets of V (i.e., an edge is associated with two vertices, and that association is defined by the two vertices being included in the subset representing the edge).

Graphs are equivalent if they have the same number of vertices and the same edge connections. The vertices do not need to have the same labels, and thery do not have to be drawn in the same positions. Select all the graphs that are equivalent.

The T-Shirt

This t-shirt is everything you've dreamed of and more. It feels soft and lightweight, with the right amount of stretch. It's comfortable and flattering for all.

• 100% combed and ring-spun cotton
• Fabric weight: 4.2 oz./yd.² (142 g/m²)
• Pre-shrunk fabric
• Side-seamed construction
• Shoulder-to-shoulder taping
• Blank product sourced from Nicaragua, Mexico, Honduras, or the US