Scribd
Upload
6 views6 pages

Some Important Questions For UNIT-5

The document outlines important questions and concepts related to graph theory, including definitions, representations, and classifications of graphs. It covers topics such as walks, paths, cycles, connectivity, special graphs, Eulerian and Hamiltonian graphs, graph coloring, isomorphism, and real-life applications of graphs. Additionally, it includes multiple-choice questions with answers to reinforce understanding of these concepts.

Uploaded by

mohammadirshad9163
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views6 pages

Some Important Questions For UNIT-5

The document outlines important questions and concepts related to graph theory, including definitions, representations, and classifications of graphs. It covers topics such as walks, paths, cycles, connectivity, special graphs, Eulerian and Hamiltonian graphs, graph coloring, isomorphism, and real-life applications of graphs. Additionally, it includes multiple-choice questions with answers to reinforce understanding of these concepts.

Uploaded by

mohammadirshad9163
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Some important questions for UNIT-5

1. Define a graph. Differentiate between directed and undirected graphs with examples.

2. Explain the following terms with examples:


a) Degree of a vertex
b) Adjacent vertices
c) Subgraph
d) Complete graph

🔹 Representation of Graphs

3. What are the different ways to represent graphs in computer memory? Explain:
a) Adjacency Matrix
b) Adjacency List
c) Incidence Matrix

🔹 Walks, Paths, and Cycles

4. Define and differentiate between a walk, a trail, a path, and a cycle.

5. Give an example of a graph that has a cycle but is not Eulerian.

🔹 Connectivity and Components

6. Define connected and disconnected graphs.

7. What is a connected component? Explain with an example.

8. Define strongly connected and weakly connected graphs (for directed graphs).

🔹 Special Graphs

9. What is a bipartite graph? Prove that a graph is bipartite if and only if it contains no odd-
length cycle.

10. Define a regular graph. Give an example of a 3-regular graph.


11. What is a planar graph? State and explain Euler’s formula for planar graphs.

🔹 Eulerian and Hamiltonian Graphs

12. Define an Eulerian graph. State and prove Euler’s theorem.

13. What is the difference between Eulerian path and Hamiltonian path?

14. Determine whether the following graph is Hamiltonian (provide an example).

🔹 Graph Coloring

15. What is graph coloring? Define chromatic number.

16. Find the chromatic number of a given graph using greedy coloring.

17. Prove that a bipartite graph has a chromatic number of 2.

🔹 Graph Isomorphism and Homomorphism

18. What is graph isomorphism? How do you check if two graphs are isomorphic?

19. Define graph homomorphism with an example.

🔹 Applications of Graphs

20. Discuss real-life applications of graphs in:


a) Computer networks
b) Social networks
c) Scheduling
d) GPS and maps
1. What is the degree of a vertex in an undirected graph?
A) Number of edges in the graph
B) Number of vertices adjacent to it
C) Number of edges incident to it
D) Number of loops at that vertex
✅ Answer: C
2. A complete graph with nnn vertices has how many edges?
A) n2n^2n2
B) n(n−1)2\frac{n(n-1)}{2}2n(n−1)
C) 2n2n2n
D) n(n+1)n(n+1)n(n+1)
✅ Answer: B

5. A path is a walk in which:


A) Vertices are repeated
B) No vertices are repeated
C) Edges are repeated
D) Only the first and last vertices are same
✅ Answer: B

6. A cycle in a graph is:


A) A path that starts and ends at the same vertex
B) A walk with repeated edges
C) A path with a repeated vertex
D) None of the above
✅ Answer: A

7. A graph is said to be connected if:


A) It has no edges
B) All vertices are reachable from any other vertex
C) It has cycles
D) It has an Euler circuit
✅ Answer: B

8. How many components does a connected graph have?


A) 0
B) 1
C) 2
D) Depends on the number of edges
✅ Answer: B

9. A bipartite graph does not contain:


A) Even cycles
B) Any cycles
C) Odd cycles
D) Loops
✅ Answer: C

10. A 3-regular graph means:


A) Every vertex has 3 edges
B) Graph has 3 vertices
C) Each vertex is connected to 3 components
D) Graph has 3 connected components
✅ Answer: A

11. A graph is Eulerian if:


A) It has an even number of vertices
B) All vertices have even degree
C) It has no loops
D) It is connected and bipartite
✅ Answer: B

12. A Hamiltonian path visits:


A) Every edge once
B) Every vertex once
C) All cycles
D) Vertices of odd degree
✅ Answer: B

13. The chromatic number of a bipartite graph is:


A) 1
B) 2
C) 3
D) n
✅ Answer: B

14. Graph coloring is used for:


A) Counting vertices
B) Avoiding adjacent vertices having the same color
C) Identifying paths
D) Counting loops
✅ Answer: B

15. Two graphs are isomorphic if they have:


A) Same number of vertices and edges
B) Same degree for all vertices
C) Identical adjacency matrices under vertex renaming
D) Same color
✅ Answer: C

16. A graph homomorphism maps:


A) Vertices to colors
B) Edges to numbers
C) Vertices of one graph to another while preserving adjacency
D) Edges to loops
✅ Answer: C

17. Graph theory is applied in:


A) Sorting algorithms
B) Operating systems
C) Network routing and shortest path problems
D) Number theory
✅ Answer: C
18. Which structure can be represented as a tree in graph theory?
A) File directory
B) Neural network
C) Linked list
D) CPU
✅ Answer: A

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy