Scribd
Upload
22 views3 pages

Graph Solved

hyut6fujty

Uploaded by

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

Graph Solved

hyut6fujty

Uploaded by

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

Graph Theory

1. What is a graph in graph theory?

a) A structure consisting of nodes and edges


b) A type of numerical analysis
c) A diagram representing equations
d) A plot of a function

2. A subgraph is:

a) A part of a graph formed by deleting some vertices and edges


b) A graph with more nodes than edges
c) A complete graph
d) A disconnected graph

3. Two graphs are said to be isomorphic if:

a) They have the same number of edges


b) They have the same number of vertices and identical connections between them
c) They are disconnected graphs
d) Their degree of vertices is equal

4. A walk in a graph is:

a) A sequence of edges where the first and last vertices are the same
b) A sequence of vertices and edges in any order
c) A sequence of vertices and edges with repetitions allowed
d) A traversal that visits all vertices without repeating

5. In a path, repetition of:

a) Edges is allowed but not vertices


b) Vertices is allowed but not edges
c) Both edges and vertices is allowed
d) Neither edges nor vertices is allowed

6. A circuit in a graph is:

a) A closed walk
b) A simple path
c) A walk that repeats vertices but not edges
d) A path with no repeated edges

7. A graph is called connected if:

a) Every vertex is connected to every other vertex by a path


b) The degree of each vertex is the same
c) All vertices have even degrees
d) It has no isolated vertices
8. The number of connected components in a disconnected graph is:

a) Always 2
b) Equal to the number of vertices minus edges
c) Greater than 1
d) Always 1

9. Eulerian graphs contain:

a) A walk that visits every vertex exactly once


b) A circuit that includes every edge exactly once
c) A cycle that contains all vertices
d) No repeated edges or vertices

10. The degree of a vertex in a graph is defined as:

a) The number of edges connected to it


b) The number of vertices adjacent to it
c) The length of the shortest path to another vertex
d) The number of loops in the graph

11. A graph with no loops or multiple edges is called:

a) A complete graph
b) A simple graph
c) A bipartite graph
d) A directed graph

12. In a complete graph with n degree of vertices, the number of edges is:

a) n²
b) n/2
c) 2n
d) n-1

13. A graph is bipartite if:

a) Its vertices can be divided into two sets where no two vertices within the same set are adjacent
b) It contains exactly two cycles
c) It is directed and acyclic
d) It is isomorphic to a tree

14. A Hamiltonian circuit visits:

a) Every edge exactly once


b) Every vertex exactly once and returns to the starting vertex
c) Every edge and vertex exactly once
d) Every vertex and every edge without repetition
15. An Euler path visits:

a) Every vertex exactly once


b) Every edge exactly once
c) Every vertex and edge exactly once
d) Every vertex multiple times

16. In a tree, the number of edges is:

a) n
b) n-1
c) n²
d) 2n

17. A graph that has an Euler circuit must have:

a) All vertices with even degree


b) At least one vertex with odd degree
c) All vertices connected by a Hamiltonian path
d) No isolated vertices

18. If a graph contains n vertices, how many edges must it have to be a tree?

a) n²
b) n(n-1)
c) n-1
d) 2n

19. Which of the following is a necessary condition for a graph to be Eulerian?

a) All vertices have odd degrees


b) All vertices have even degrees
c) The graph has no isolated vertices
d) The graph has exactly one Hamiltonian cycle

20. A graph G is said to be acyclic if:

a) It contains no cycles
b) It has an Eulerian path
c) It has the same number of vertices and edges
d) It is disconnected

You might also like