Successive vertex orderings of graphs

A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier.

Such orderings arise naturally in incremental growth and connectivity-preserving constructions, where vertices are added sequentially and must attach to the existing structure.

We derive an exact formula for the number of successive vertex orderings of any finite connected graph.

The formula is obtained via an inclusion--exclusion argument over independent sets and depends on two explicit combinatorial parameters, one of which is defined recursively.

The result applies to all finite connected graphs without requiring regularity or symmetry assumptions.

We also express the enumeration as a weighted generating polynomial over independent sets; its value at $x = -1$ recovers the total count of successive orderings, and the $k$-th derivative at this point encodes the number of orderings in which exactly $k$ non-first vertices appear before all of their neighbours.