The Answer to the Question
is below this banner.
Here's the Solution to this Question
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order.
2)There is always a spanning tree of G that contains e,f and g
A tree is said to be a spanning tree of a connected graph G, if T is a subgraph of G and T contains all vertices of G.
Let graph has n vertices from which one node is disconnected, maximum number of edges between the remaining n−1 nodes can be
4)If there exist a cut-vertex in the graph, then a cut-edge must also exist.
If a cut vertex exists, then the existence of any cut edge is not necessary.