Week 2 Flashcards
1
Q
What is r-Connectivity?
A
2
Q
What is a Harry Graph?
A
3
Q
How to construct a Harary Graph if r and n is even?
A
4
Q
How to construct a Harary Graph if r odd and n is even?
A
5
Q
How to Harary Graph construct both r and n are odd?
A
6
Q
What is the definition of vertex independent?
A
7
Q
What is the definition of edge-independent?
A
8
Q
What is Menger’s theorem?
A
9
Q
What is the definition of Biparte graph?
A
10
Q
What is the definition of a ranked embedding?
A
11
Q
What is the theorem about biparte, and ranked embedding?
A
12
Q
What is the definition of a planar graph?
A
13
Q
What is Euler’s theorem?
A
14
Q
What is a theorem about a planar graph with n ≥ 3 and m edges?
A
15
Q
What is a theorem about a planar graph and one vertex v, with delta(v)?
A