2.4 When does a graph have a euler walk Flashcards by Aiden Dawes | Brainscape

Q

What is a path

A

A path is a walk in which no vertices repeat.

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is a connected graph

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is a subgraph and an induced subgrah

A

Subgraph: can remove edges and vertices
Induced subgraph: can only remove vertices (and corresponding edges)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is a component

A

A maximal induced subgraph (ie: a maximal connected subgraph)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly