Which type of graphs are always (n – 1)-vertex connected? All graphs with n vertices. Cn Kn Ln

Which of these best describes the behavior from B to C in the given graph? im A D. Olinear and increasing Onon linear and increasing Olinear and decreasing Inon linear and decreasing

Use the formula deg(v) = 2|E(G)| to find the number of edges of the following vЄV (G) graphs. Classify (count) the vertices by number of neighbors. (a) V(G) = [100]. Edges: for all n and m in [100], n ‡ m, n is adjacent to m if and only if |nm| ≤ 4. (b) V(G) = [10] × [10]. Edges: for all (a, b) and (c,d) in [10] × [10], (a, b) ‡ (c,d), (a, b) is adjacent to (c,d) if and only if a = c or b = d. (c) V(G) = [10] × [10]. Edges: for all (a, b) and (c,d) in [10] × [10], (a, b) ‡ (c,d), (a, b) is adjacent to (c,d) if and only if |ac| + |bd| = 1. (d) V (G) = [10] × [10]. Edges: for all (a, b) and (c,d) in [10] × [10], (a, b) is adjacent to (c,d) if and only if |a - c + b-d ≤ 2. (a, b) ‡ (c,d),

Which statement is TRUE? a. The sum of all degrees of a cycle graph equals 2* number of edges  b. An empty graph has |V|=0 and |E|=0 c. A complete graph is also a cycle graph d. The degree of vertices of a K-regular graph must be always 2