Single-hook characters and hamiltonian circuits

This paper consider coefficients. schur functions, immanants and graph theory. The connecting thread is the concept of a single-hook character of the symmetric group. It is shown, for example, that the number of Hamiltonian circuits in a finite graph may be expressed as an alternating sum of immanants.