# Extra-factorial sum: a graph-theoretic parameter in Hamiltonian cycles of complete weighted graphs

## TL;DR

This paper explores the extra-factorial sum, a graph-theoretic parameter related to Hamiltonian cycles in complete weighted graphs, providing proofs, tutorial explanations, and new unpublished results.

## Contribution

It offers a tutorial presentation of the extra-factorial sum with proofs and introduces new unpublished lemmas related to Hamiltonian cycles in complete weighted graphs.

## Key findings

- The extra-factorial sum relates to the arithmetic mean of Hamiltonian cycle lengths.
- It depends on the number of vertices n and involves factorial terms.
- New lemmas extend the understanding of Hamiltonian cycle properties.

## Abstract

A graph-theoretic parameter, in a form of a function, called the extra-factorial sum is discussed. The main results are presented in ref. [1] (Nastou et al., Optim Lett, 10, 1203-1220, 2016) and the reader is strongly advised to study the aforementioned paper. The current work presents subject matter in a tutorial form with proofs and some newer unpublished results towards the end (lemma six extension and lemma seven). The extra-factorial sum is relevant to Hamiltonian cycles of complete weighted graphs $WH_n$ with $n$ vertices and is obtained for each edge of $WH_n$. If this sum is multiplied by $1 / (n - 2)$ then it gives directly the arithmetic mean of the sum of lengths $l_i$ of all Hamiltonian cycles that traverse a selected edge $e_q$. The number of terms in this sum is a factorial proven to be $(n - 2)!$ which signifies that its value depends on $n$. Using the extra-factorial sum, the arithmetic mean of the sum of the squared lengths of $(n - 1)! / 2$ Hamiltonian cycles of $WH_{n}$ can be obtained as well.