Ask Question / Post resume

Post a reply to the thread: www.srgi.ac.in Graph Theory Model Question Paper : S.R.Group of Institutions

Your Message

Your Username:

Notes:-
1) You can copy and paste your full resume in the box below.
2) Or you can ask your question. We try to answer, as far as possible.

Title:

[QUOTE=ijt.dolora@gmail.com;273154][B][U]Name of the Organisation [/U][/B]: S.R.Group of Institutions (srgi.ac.in)
[B][U]Type of Facility [/U][/B]: Graph Theory Model Question Paper 
[B][U]Home Page [/U][/B]: [URL]http://www.srgi.ac.in/[/URL]
[B]Section- A (Objective Type) 
[U]Questions from all sections [/U]:[/B]
Q1. Graph with a finite number of vertices as well as a finite number of edges is called.
a) Planar graph b) Finite graph c) Infinite graph d) None of these
Q2. All vertices are of equal degree is ……………….
a) Null graph b) Regular graph c) Planar graph d) Euler graph
Q3. A graph G= (V, E), it is possible for the edge set E to be empty, such graph is ……..
a) Planar graph b) Euler graph c) Null graph d) None of these
Q4. The number of vertices of odd degree is a graph is always …….
a) Odd b) Even c) May be both d) None of these
Q5. A vertex having no incident edge is ………….
a) end vertex b) isolated vertex c) pendent vertex d) none of these
Q6. A graph G is said to be …… if there is atleast one path between every pair of vertices in G.
a) Disconnected graph b) Connected graph
c) Euler graph d) Hamiltonian graph\
Q7. The maximum degree of any vertex in simple graph
a) n b) n+1 c) n-1 d) 2n
Q8. The size of a simple graph of order n cannot exceed
a) nc1 b) nc2 c) n1 d) none of these
Q9. The maximum number of edges in a simple graph with n vertices
a) n(n-1) b) n(n-1)/2 c) n(n+1) d) none of these
Q10. A graph G with n-vertices is called a tree is
a) G is circuit less and has n-1 edges b) G is minimum connected graph
c) G is connected and is circuit less d) All of the above

[B]Section- B (Short Type)
[U]Answer any seven questions out of the following questions.[/U][/B]
Q1. Explain graph with suitable example.
Q2. Explain directed and undirected graph.
Q3. Is it possible to draw a simple graph with 4 vertices and 7 edges? Justify.
Q4. Explain ‘walk and paths’
Q5. Explain Euler graph and Hamiltonian graphs
Q6. Show that the complete graph kn is not a tree when, n>2
Q7. Explain a tree and its kind.
[B]
Section- C (Long Type) [/B]
[U][B]Answer any four questions out of the following questions.[/B][/U]
Q1. Determine the number of edges in a graph with 6 vertices, 2 of degree 4 and 4 of degree 2. Draw two such graphs.
Q2. Show that the maximum number of edges in a simple graph with n vertices is n(n-1)/2
Q3. Explain types of graphs.
Q4. Explain spanning tree and identify all the spanning tree for given graph.

[B][U]More question get here [/U][/B]: [URL]http://www.srgi.ac.in/Model%20Paper/ECS%20505.pdf[/URL][/QUOTE]

All times are GMT +5.5. The time now is 06:56 PM.