Ask Your Doubts ×
Solve your IGNOU Doubts
Solve your IGNOU Doubts
Question:

(a) Find the line graph of the following graph? Write number of vertices and edges in the line graph.

Image ignouacademy-com--p-academy-28781

See Answer →
Question:

(c) Prove or disprove: If G is a graph with χ(G) denoting its chromatic number, thenequation

See Answer →
Question:

(b) Using Fleury’s algorithm, find an Eulerian circuit in the following graph.

Image ignouacademy-com--p-indias-75674

See Answer →
Question:

(a) Find the values of n and m for which the star graph Sn,mis Eulerian.

See Answer →
Question:

(d) Provide an example of a 3-regular planar graph with 8-vertices. Is this graph a maximal planar graph? Why?

See Answer →
Question:

(c) State and prove Hall’s Theorem

See Answer →
Question:

Show that [S, T] is an (s, t)-cut in network N give in part(a),where equationDoes N have an other (s, t)-cut with capacity smaller than Cap(S, T)? What is the maximum possible value of a flow in N?

See Answer →
Question:

(a) What is the maximum possible flow that can pass through the following network N? Define such a flow

Image ignouacademy-com--p-ignou-88788

See Answer →
Question:

(d) Find the matching number of the line graph of the graph given in part(a).

See Answer →
Question:

(c) For every graph equationTrue or false? Justify.

See Answer →
Question:

(b) Check whether the graph equationis planar or not.

See Answer →
Question:

(a) Verify Euler’s formula for the following plane graph.

Image ignouacademy-com--p-ignou-35521

See Answer →
Question:

(c) Check the sequence (6, 5, 4, 4, 3, 1, 1, 1, 1) is graphic or not. Also, find a graph realising it.

See Answer →
Question:

Is it possible that a graph is 3-chromatic but not 3-critical? If so, explain it with an example.

See Answer →
Question:

(a) Show that there are 14 spanning trees of the following graph. Draw all the spanning trees.

Image ignouacademy-com--p-provider-16262

See Answer →
Question:

(d) Find the chromatic and edge-chromatic numbers of the following graph

Image ignouacademy-com--p-ignou-49114

See Answer →
Question:

(c) Determine the number of non-planar graphs with 6 vertices. 

See Answer →
Question:

(b) Find a minimum-weight spanning tree in the following graph.

Image ignouacademy-com--p-ignou-52022

See Answer →
Question:

(a) Prove or disprove: A connected graph with order and size equal must contain exactly one cycle.

See Answer →
Question:

Check whether the following graphs G and H are isomorphic or not.

Image ignouacademy-com--p-ignou-69420

See Answer →
Top
📞
Call Support Instant phone assistance IGNOU Academy - India’s Largest IGNOU Help Book Provider
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→