cycle

Let G be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in G has even weight. Which of the following statements i...

In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?

What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?

Let T be a depth first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of both u and v in G are at least 2. which one of the following...