Def: non-empty vertex set + finite edge set (often empty)

G = (V,E)

V = {A, B, C, D}

E = {e1, e2, e3, e4, e5} = {AB, AC, BD, BC, AD}

AB == BA

adjacent - edge connects

incident - e1 is incident on A & B

degree - #edges at vertex

isomorphic grap vs equal graphs

| V(G) | == order (i.e. size of vertex set)

| E(G) | == size (i.e. size of edge set)

k-regular == degree of every vertex is k

complete graph of order n

degree of each vertex is n - 1

Suggested Graph ADT Operators

Return to CIS 350 Index Page