- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- A graph is said to have a negative weigh...

Q. |
## A graph is said to have a negative weight cycle when? |

A. | the graph has 1 negative weighted edge |

B. | the graph has a cycle |

C. | the total weight of the graph is negative |

D. | the graph has 1 or more negative weighted edges |

Answer» C. the total weight of the graph is negative | |

Explanation: when the total weight of the graph sums up to a negative number then the graph is said to have a negative weight cycle. bellmann ford algorithm provides no solution for such graphs. |

View all MCQs in:
Design and Analysis of Algorithms

- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- How many solution/solutions are available for a graph having negative weight cycle?
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- Dijkstra’s Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.
- Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.
- A graph is found to be 2 colorable. What can be said about that graph?
- It is possible to have a negative chromatic number of bipartite graph.
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?

Login to Continue

It will take less than 2 minutes

Report MCQ