Question

Which of the following statements is always correct for any two spanning trees for a graph ?
1) Sum of weights of edges is always same
2) Selected vertices have same degree
3) Have same number of edges
4) Have same number of edges and sum of weights of edges is also same

Answer 1

Option 2).

Plz mark me as the brainliest.

Answer 2

Answer is Option "2"

Explanation:

• The logical image of a graph’s vertex is “a point” while the logical image of a graph’s edge is “a straight or a curved line”. An edge may connect a distinct pair of vertices or it may loop back and return to where it started from (without visiting any other vertices)
• Depending on the cardinality of the set V graphs may be finite or infinite. I will only consider finite graphs
• Narrowing the scope further: I shall only consider graphs with no loops and with no multiple edges - in what follows a pair of vertices may be connected with at most one edge
• Hence, the right answer is option 2 "Selected vertices have same degree"