Categories

# CS6702 Important Questions Graph Theory and Applications

CS6702 Important Questions Graph Theory and Applications Regulation 2013 Anna University free download. Graph Theory and Applications CS6702 Important Questions pdf free download.

## Sample CS6702 Important Questions Graph Theory and Applications:

1. Define Graph.
A graph G = (V, E) consists of a set of objects V={v1, v2, v3, … } called vertices (also called points or nodes) and other set E = {e1, e2, e3, …….} whose elements are called edges (also called lines or arcs).
The set V(G) is called the vertex set of G and E(G) is the edge set of G.
For example : CS6702 Important Questions Graph Theory and Applications
A graph G is defined by the sets V(G) = {u, v, w, x, y, z} and E(G) = {uv, uw, wx, xy, xz}.
A graph with p-vertices and q-edges is called a (p, q) graph. The (1, 0) graph is called trivial
graph.

2. Define Simple graph. CS6702 Important Questions Graph Theory and Applications
 An edge having the same vertex as its end vertices is called a self-loop.
 More than one edge associated a given pair of vertices called parallel edges.
 A graph that has neither self-loops nor parallel edges is called simple graph.

3. Write few problems solved by the applications of graph theory. CS6702 Important Questions Graph Theory and Applications
Konigsberg bridge problem
Utilities problem
Electrical network problems
Seating problems

4. Define incidence, adjacent and degree. CS6702 Important Questions Graph Theory and Applications
When a vertex vi is an end vertex of some edge ej, vi and ej are said to be incident with each other. Two non parallel edges are said to be adjacent if they are incident on a common vertex. The number of edges incident on a vertex vi, with self-loops counted twice, is called the degree (also called
valency), d(vi), of the vertex vi. A graph in which all vertices are of equal degree is called regular graph.

 Subject Name Graph Theory and Applications Subject code CS6702 Regulation 2013