Week 1 > Basic Definitions Flashcards

1
Q

What are the path graphs Pn?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the cycle graph?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the complete graph?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the trees?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q
A

Yes, since you can not pick any given vertex and come back to it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
A

v3 is the root of the both trees

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are Bipartite Graphs?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Draw a complete bipartite graph of K2,3

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Is it Cycle Bipartite Graph and why?

A

Yes, since L and S sets have vertices are connected and comply to bipartite graph definition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly