If we have two graphs G1 = (V1, E1) and G2= (V2, E2) and V1 = {a, b, c}, E1 = {(

Question

If we have two graphs G1 = (V1, E1) and G2= (V2, E2) and V1 = {a, b, c}, E1 = {(a, c), (b, c), (a, b)}, V2 = {a, b, c}, E2 = { (c, a) , (c, b), (a, b) }. Which statement below is not true?

Question 1 options:

E1 = E2

G1 = G2

|G1| = |G2|

V1 = V2

If we have two graphs G1 = (V1, E1) and G2= (V2, E2) and V1 = {a, b, c}, E1 = {(a, c), (b, c), (a, b)}, V2 = {a, b, c}, E2 = { (c, a) , (c, b), (a, b) }. Which statement below is not true?

Question 1 options:

a)

E1 = E2

b)

G1 = G2

c)

|G1| = |G2|

d)

V1 = V2

Explanation / Answer

Since the edges are represented as ordered pairs the given graphs are directed graphs. Hence E1=E2 is not true. Since E1 has edges from a to c, b to c, and a to b. Whereas E2 has edges from c to a, c to b and a to b. The directions of edges are different for two of the edges in each edge set. Since edge sets are different for each graphs G1 and G2 are not equal. But the vertex sets are equal and hence |G1|=|G2|.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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