Week 1

Question 1

What is the definition of a neighborhood? What does it mean?

Answer 1

A neighborhood are all the nodes connected to other nodes.

Question 2

What is the definition of a simple graph?

Answer 2

Question 3

What is the definition of the degree of a vertex?

Answer 3

Question 4

How do we compute the total sum of degrees?

Answer 4

Question 5

What is the definition of the degree sequence?

Answer 5

Question 6

When is a sequence of numbers graphic?

Answer 6

Question 7

What is an adjencency list? How much memory does it use?

Answer 7

Question 8

What is an Ajdencency matrix? How much memory does it use?

Answer 8

Question 9

What are the important three properties of the adjecency matrix?

Answer 9

Question 10

What is the definition of a subgraph?

Answer 10

Question 11

What is the definition of a subgraph denoted by V*?

Answer 11

Question 12

What is the definition of a the subgraph induced by E*?

Answer 12

Question 13

When is a graph isomorphic?

Answer 13

Question 14

How to determine that two graphs are not isomorphic?

Answer 14

Question 15

What is the The Havel-Hakimi’s theorem? What does it mean?

Answer 15

Question 16

How to use The Havel-Hakimi’s theorem?

Answer 16

Question 17

What is the definition of a walk?

Answer 17

Question 18

What is the definition of a path?

Answer 18

Question 19

What is the definition of a cycle?

Answer 19

Question 20

What is the definition a connected graph? What are the three equivalence relations?

Answer 20

Question 21

What is the definition of a component of a graph?

Answer 21

Question 22

What is the definition of a vertex cut?

Answer 22

Question 23

What is the definition of an edge cut?

Answer 23

Question 24

What is the 𝛋(G) and λ(G)?

Answer 24

Question 25

What is a theorem about the minimum edge cuts and

Answer 25