16 vertices.16 vertices.16 vertices.16 vertices.
A pentacontagon has 50 vertices (not vertices's!).
5 vertices
8 vertices
It has 8 vertices
There are (7 - 1)!/2 = 6!/2 = 360 of them.
15
The term "cyclic graph" is not well-defined. If you mean a graph that is not acyclic, then the answer is 3. That would be the union of a complete graph on 3 vertices and any number of isolated vertices. If you mean a graph that is (isomorphic to) a cycle, then the answer is n. If you are really asking the maximum number of edges, then that would be the triangle numbers such as n (n-1) /2.
There are 7 edges.
one vertex: 3 two vertices: 6 three vertices: 8 total 17
In a connected component of a graph with Mi vertices, the maximum number of edges is MiC2 or Mi(Mi-1)/2. So if we have k components and each component has Mi vertices then the maximum number of edges for the graph is M1C2+M2C2+...+MKC2. Of course the sum of Mi as i goes from 1 to k must be n since the sum of the vertices in each component is the sum of all the vertices in the graph which you gave as n. Where MC2 means choose 2 from M and there are M(M-1)/2 ways to do that.
No of spanning trees in a complete graph Kn is given by n^(n-2) so for 5 labelled vertices no of spanning trees 125
16 vertices.16 vertices.16 vertices.16 vertices.
A pentacontagon has 50 vertices (not vertices's!).
8 vertices
Eight vertices
it has 30 vertices