Discrete Maths - Graphs
7. Maximum degree of any node in a simple graph with n vertices is
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
8. Two isomorphic graphs must have
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
9. A given connected graph G is a Eular graph if and only if all vertices of G are of
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
10. Total number of edges in a complete graph of n vertices is
- Option : C
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.