ArchWizards Reviewer

An acquaintanceship graph is an undirected graph in which the nodes represent people and nodes a and b are adjacent if a and b are acquainted.  The following figure represents an acquaintanceship graph for residents of an apartment building. Are Carl and Fletcher acquainted? 

• Carl and Fletcher are acquainted

• Cannot be determined from the graph.

• Carl and Fletcher are not in the same building.

• Carl and Fletcher are not acquainted

The following figure represents an acquaintanceship graph for residents of an apartment building.

How many people is Siu Yin acquainted with?

• 1

• 2

• 0

• 3

The following figure represents an acquaintanceship graph for residents of an apartment building. What is the degree of separation between Carl and Yuri?

• 0

• 1

• 2

• 3

Which of the following graphs is not isomorphic to the others?

• a

• b

• c

• All of them

Determine whether the graph is planar.

• Planar

• Not planar

What is the height?

• 4

• 3

• 2

• 1

What is the left child of node 2?

• 2

• 3

• 1

• 4

What is the depth of node 5?

• 1

• 2

• 4

• 3

Determine whether the given graph has an Euler path.

• Yes

• No

Determine whether this graph has a Euler path.

• Yes

• No