Graph theory 17

How many Hamiltonian paths does the above graph have?

• 1

• 2

• 0

• 3

How many times do you visit a vertex while traveling along a Hamilton circuit or path?

• 4

• 0

• 2

• 1

A block with two adjacent vertices of degree 3 and all

other vertices of degree 2 is called _____.

• Euler graph

• a theta graph

• Complete graph

• none of the above

Which of the following statements about Eulerian graphs is true?

• Exactly two vertices have odd degree

• Exactly two vertices have even degree

• All vertices have even degree

• More than two vertices are of odd degree

What kinds of graphs does Fleury's algorithm work for?

• Multiple graphs

• Hamiltonian graphs

• Pseudo graphs

• Eulerian graphs

A digraph is called functional if every point has out-degree___

• four

• two

• three

• one

The outdegree of vertex X is

• 1

• 2

• 4

• 3

A digraph is said to be strongly connected if

• underlying graph is disconnected

• underlying graph is connected

• foe every pair of points atleast one point is reachable from other

• Every pair of points are mutually reachable

The score of a point in a tournament is its

• indegree

• outdegree

• points

• vertices

The degree pair of vertex c is

• (1,2)

• (2,1)

• (1,3)

• (3,1)