- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- Which of the following properties does a...

Q. |
## Which of the following properties does a simple graph not hold? |

A. | Must be connected |

B. | Must be unweighted |

C. | Must have no loops or multiple edges |

D. | Must have no multiple edges |

Answer» A. Must be connected |

View all MCQs in:
Data Structures (DS)

- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- Which of the following statements for a simple graph is correct?
- 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?
- Which of the following is useful in traversing a given graph by Breath first search?
- Which of the following properties is associated with a queue?

Login to Continue

It will take less than 2 minutes

Report MCQ