# Chapter 3: Connectivity and Paths Flashcards

1

Q

Adjacency Matrix Walk Counting

A

2

Q

Vertex/Edge Relationship with Connected Components

A

3

Q

Connected Graph on n vertices has how many edges?

A

4

Q

Euler’s Theorem (Eulerian Graph)

A

5

Q

All degrees even means what for maximal trails?

A

6

Q

Semi-Eulerian Condition

A

7

Q

Fleury’s Algorithm

A

8

Q

Hamiltonian Cycle Relationship with connected components

A

9

Q

Hamiltonian and Bipartite implies

A

10

Q

Dirac’s Theorem

A

11

Q

Ore’s Theorem

A

12

Q

Tree Leaf Facts

A

13

Q

Edges in a cycle are not…

A

14

Q

Characterisation of Trees with n vertices

A

15

Q

Tree/Path Condition

A

16

Q

Tree More Facts

A

17

Q

Prüfer Code Facts

A

18

Q

Cayley’s Theorem, 1889

A

19

Q

Matching/Augmenting Path Relationship

A

20

Q

Berge, 1957

A