Categories

# CS6702 Question Bank Graph Theory and Applications

CS6702 Question Bank Graph Theory and Applications Regulation 2013 Anna University free download. Graph Theory and Applications CS6702 Question Bank pdf free download.

## Sample CS6702 Question Bank Graph Theory and Applications:

1 i) In a complete graph having odd number of vertices, how
many edge disjoint Hamiltonian circuits exist?
ii) State the two theorems to check if a connected graph G is
Eulerian. Explain with proof
iii) Find a path of length 9 and a circuit of length 8 in
Peterson graph. CS6702 Question Bank Graph Theory and Applications
2 i) Illustrate the search algorithm than can be employed to
find the components or blocks in a graph, with an example

3 Give the proof for the following CS6702 Question Bank Graph Theory and Applications
i) If a graph has exactly two vertices of odd degree, there
must be a path joining these two vertices.
ii) A connected graph is an Euler graph if and only if every
vertex has even degree
iii) A connected graph is an Euler graph if and only if it can
be decomposed into circuits

4 i) Show thatthe ring-sum of any two cut-sets in a graph is
either third cut-set or an edge disjoint union of cut-sets. CS6702 Question Bank Graph Theory and Applications

5 i) Establish and prove the relation between vertex
connectivity, edge connectivity and number of vertices
and edges 8 Apply BTL3
ii) Explain the proof of following theorem
The largest number of edges in a planar graph is 3n-6,
where n is the number of vertices in, the graph

 Subject Name Graph Theory and Applications Subject code CS6702 Regulation 2013