How to calculate the number of possible connected simple graphs with n labelled vertices where only one connected to each other vertices

Question

I saw this question: How to calculate the number of possible connected simple graphs with $n$ labelled vertices

But how can we count graphs with only one dominant vertex (only one vertex in graph that connected to each other node)?

Suppose that we had a set of vertices labelled 1,2,…,n.

In what efficient way do we be able to calculate the number of possible ways the graph can be made?

score 0 · Accepted Answer · answered Mar 30 '21 at 17:13

0

The answer is $n$ multiplied by the number of graphs on $n-1$ vertices with no dominant vertices.

How many graphs on $n$ vertices have no dominant vertices? this can be obtained via inclusion-exclusion, it yields $\sum\limits_{i=0}^n(-1)^i\binom{n}{i}2^{\binom{n-i}{2}}$

Hence the answer to your question is $n\sum\limits_{i=0}^{n-1}(-1)^i\binom{n-1}{i}2^{\binom{n-1-i}{2}}$

answered Mar 30 '21 at 17:13

Asinomás

107,565

Is first formula for graph with all connected vertices? Because we can have situation where there is two independent graphs connected only by dominant vertex. – Rick Lena Mar 30 '21 at 17:26
This formula accounts for stars as well, I think that is what you are asking. – Asinomás Mar 30 '21 at 17:34
Yes, it is. Now everything fine. I just misunderstood at first. Thank you! – Rick Lena Mar 30 '21 at 17:43

How to calculate the number of possible connected simple graphs with n labelled vertices where only one connected to each other vertices

1 Answers1