A graph in which all vertices have equal degree is known as ____

Related MCQs

• 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.
• What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
• A graph with all vertices having equal degree is known as a
• 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 value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
• For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
• For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
• What is the number of edges present in a complete graph having n vertices?