Let G = (V, E) be a simple undirected graph of n vertices. There is one vertex of degree $n-1$. How many simple undirected graphs we can form such that the graph contains only one vertex of degree n−1
It is straight forward but I am stuck. Any hint would help. Thanks.
**Simple: No loops, no parallel edges. Undirected: it isn't a digraph