A graph with all vertices having equal degree is known as a

Related MCQs

• What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• A graph in which all vertices have equal degree is known as ____
• Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• Maximum degree in any vector in a graph with n vertices is ________.
• The number of edges in a regular graph of degree d and n vertices is _______.
• What is the number of edges present in a complete graph having n vertices?
• A connected planar graph having 6 vertices, 7 edges contains regions.
• What is the maximum number of edges in a bipartite graph having 10 vertices?