Walks, Trails, Paths, and Cycles:, E, V, E, - . - , E, V I K, The Edge e
Walks, Trails, Paths, and Cycles:, E, V, E, - . - , E, V I K, The Edge e
Walks, Trails, Paths, and Cycles:, E, V, E, - . - , E, V I K, The Edge e
S1
I1 I2
S2
S1
I1 I2
S2
5
Bipartite graphs
A set of pairwise adjacent vertices in a graph is called
a clique. A set of pairwise non-adjacent vertices in a
graph is called an independent set.
Properties.
• v(Qk ) = 2k
• Qk is k-regular
• e(Qk ) = k2k−1
• Qk is bipartite
6
The beauty of being bipartite