Have an account?
Skip to Content
20 questions
Show Answers
See Preview
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following statements for a simple graph is correct?
Every path is a trail
Every trail is a path
Every trail is a path as well as every path is a trail
Path and trail have no relation
- Multiple ChoicePlease save your changes before editing any questions.
For the given graph(G), which of the following statements is true?
The covering number of the graph is 1
G is not a connected graph
Independence number of the graph is 1
Both A and C
- Multiple ChoicePlease save your changes before editing any questions.
What is the number of edges present in a complete graph having n vertices?
n
n-1
n(n-1)/2
n+1
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following is true?
A graph may contain no edges and many vertices
A graph may contain many edges and no vertices
A graph may contain no edges and no vertices
A graph may contain no vertices and many edges
- Multiple ChoicePlease save your changes before editing any questions.
The given Graph is regular.
True
False
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following statements is/are true?
Number of odd degree vertices is even.
Sum of degrees of all vertices is even.
Both A and B
Neither A nor B
- Multiple ChoicePlease save your changes before editing any questions.
A graph G is r-Regular if,
deg(v)=r for all v in V(G)
d(u,v)=r for all u,v in V(G)
|V(G)|=r
|E(G)|=r
- Multiple ChoicePlease save your changes before editing any questions.
Pick the incorrect statement
Every graph is a subgraph to itself
Empty graphs are regular of degree one
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following is not a property of Complete Bipartite Graph?
It consists of two sets of vertices X and Y.
The vertices of set X join only with the vertices of set Y.
The vertices within the same set do not join.
Each vertex in the same set are adjacent.
- Multiple ChoicePlease save your changes before editing any questions.
Bipartite Graph Contain
No odd cycles
Odd cycles
Even cycles
No even cycles
- Multiple ChoicePlease save your changes before editing any questions.
A simple graph in which any two vertices are adjacent is called………?
Bipartite Graph
Complete Bipartite Graph
Complete Graph
None of these
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following statement is true?
Every subgraph of a Complete graph is itself Complete.
Every subgraph of a Complete bipartite graph is itself Complete bipartite.
Every subgraph of a bipartite graph is itself bipartite.
None of these
- Fill in the BlankPlease save your changes before editing any questions.
A graph whose edge set is empty is called ...............
- Multiple ChoicePlease save your changes before editing any questions.
An independent set in a graph is,
A set of pairwise nonadjacent vertices
A set of pairwise adjacent vertices
A set of pairwise vertices
None of the above
- Multiple ChoicePlease save your changes before editing any questions.
The degree of a vertex is the number of edges incident with that vertex.
True
False
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following is an example of an r-regular graph?
A complete graph with r vertices.
complete bipartite graph with r vertices in each part
complete bipartite graph with r+1 vertices in each part
None of these
- Multiple ChoicePlease save your changes before editing any questions.
Any two isomorphic graphs determine the same partition.
True
False
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following statement is true?
Two simple graphs G and H are isomorphic if and only if complement of G is isomorphic to complement of H.
Two simple graphs G and H are isomorphic if and only if number of vertices in H and number of vertices in G are same.
Two simple graphs G and H are isomorphic if and only if number of edges in G and number of edges in H are same.
None of these
- Multiple ChoicePlease save your changes before editing any questions.
Which of the following is an example of a self complimentary graph?
Complete graph with 4 vertices.
Path with 4 vertices.
Complete graph with 9 vertices.
None of these
- Multiple ChoicePlease save your changes before editing any questions.
If G is a bipartite graph, then
Edge independence number of G < Covering number of G
Edge independence number of G > Covering number of G
Edge independence number of G = Covering number of G
Edge independence number of G is not equal to Covering number of G