Answer true or false to each of the following terminology questions. Two vertice

Question

Answer true or false to each of the following terminology questions. Two vertices are said to be incident if there is an edge joining them. Two edges are said to be adjacent they have a vertex in common. The complete graph K_4 has four vertices and four edges. The cycle graph C_4 has four vertices and four edges. the graph K_5, 7 has 12 vertices and 35 edges. It is not possible for a simple graph to have a degree sequence of 4, 4, 3, 3, 2, 2, 2, 1. It is not possible for a simple graph to have a degree sequence of 6, 5, 4, 3, 2. It is not possible for a simple graph to have a degree sequence of 6, 5, 4, 3, 2. Here, a degree sequence for a graph G = (V, E), with V={v1, v2, .., v_n}, is the sequence s_i = deg(v_i) for 1 lessthanorequalto i lessthanorequalto n (the sequence: deg(v_1), deg(v_2), .., v_n)). So for a list of 8 numbers (e.g., in the case of 1(f) with 4, 4, 3, 3, 2, 2, 2, 1), you can infer you are dealing with a graph having 8 vertices.

Explanation / Answer

Answer :

1a)Two vertices are said to be incident if there is an edge joining them

Answer :

False, Two vertices are said to be incident if there is an edge joining them

...................

1b)Two edges are said to be adjacent they have a vertex in common.

Answer :

True

..............

1c)The complete graph k4 has four vertices and four edges.

Answer :

False

...........

1d)The Cycle graph C4 has four vertices and four edges.

Answer :

False

.............

Explanation :

False,

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.