Which of the following properties does a simple graph not hold?

Related MCQs

• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• Which data structure is used in breadth first search of a graph to hold nodes?
• Which of the following statements for a simple graph is correct?
• A graph is a tree if and only if graph is
• 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?
• 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?
• Which of the following graph traversals closely imitates level order traversal of a binary tree?
• For the given graph(G), which of the following statements is true?
• For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
• Which of the following ways can be used to represent a graph?