Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
What is the vertex set of the Cartesian product if G1 has vertices {A, B} and G2 has vertices {1, 2}?
Consider pairwise combinations of vertices.
Define the degree of vertex (A, 2) if vertex A in G1 has degree 2 and vertex 2 in G2 has degree 3.
Add the degrees of A and vertex 2.
What does the Cartesian product of two graphs produce?
Think about how we structure new vertices from existing ones.
True or False: The edges of the Cartesian product are solely based on edges from the first graph.
Remember the conditions for forming edges.
Given two graphs where G1 has 4 vertices and 2 edges, G2 has 3 vertices and 2 edges, find the Cartesian product of the two graphs including the vertex and edge counts.
Apply the previous edge counting formulas carefully to both graphs.
Create a unique Cartesian product for G1 with a tree structure and G2 as a cycle graph. Discuss the resulting graph structure and edge counts.
Explore specific characteristics of tree and cycle interactions.
5 more questions in this section. Enroll free to practise them all.
Enroll free