simple-graph

Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is __________.

An ordered $$n$$-tuple $$\left( {{d_1},\,\,{d_2},\,....,{d_n}} \right)$$ with $${{d_1} \ge ,\,\,{d_2} \ge .... \ge {d_n}}$$ is called graphic if there exists a simple undirected gr...

The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence...

Which one of the following is TRUE for any simple connected undirected graph with more than $$2$$ vertices?

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?

Maximum number of edges in a n - node undirected graph without self loops is

The number of distinct simple graph with upto three nodes is