Graph Theory and Numerical Methods Worksheet

A connected graph without any cycles is called a:

• Free graph

• Circuit graph

• Tree

• Bipartite graph

If two graphs are isomorphic, they must have:

• The same number of vertices

• The same number of edges

• The same degree sequence

• All of the above

The number of edges incident to a vertex is called its:

• Degree

• Diameter

• Eccentricity

• Length

Which of the following is a limitation of the bisection method?

• It may not converge

• It is very slow

• It requires complex derivatives

• It cannot be used for polynomials

What type of equations can the Newton-Raphson method solve?

• Algebraic equations only

• Transcendental equations only

• Both algebraic and transcendental equations

• Linear equations only

The linear inequalities or restrictions on the variables of an LPP are called:

(a)  

A transportation problem is considered "balanced" when:

• Total supply > Total demand

• Total supply < Total demand

• Total supply = Total demand

• Number of rows = Number of columns