The extra-factorial sum for an edge e_q in WH_n sums the lengths of all (n-2)! Hamiltonian cycles containing e_q; dividing by (n-2) yields the arithmetic mean of those cycle lengths.
With the addition of vertices and starting withn = 3, the new T n+k i tends exactly to: n(n+ 1)(n+ 2)(n+ 3)/uni22EF(n+ k− 1)= (n+ k− 1)! 2 (3) A X Y CB FIG
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Extra-factorial sum: a graph-theoretic parameter in Hamiltonian cycles of complete weighted graphs
The extra-factorial sum for an edge e_q in WH_n sums the lengths of all (n-2)! Hamiltonian cycles containing e_q; dividing by (n-2) yields the arithmetic mean of those cycle lengths.