For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

Related MCQs

• Number of vertices with odd degrees in a graph having a eulerian walk is
• 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.
• 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?
• What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
• 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?
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• A connected planar graph having 6 vertices, 7 edges contains regions.
• What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
• A graph in which all vertices have equal degree is known as ____
• What is the number of edges present in a complete graph having n vertices?