A deletion-contraction algorithm for the characteristic polynomial of a multigraph

Citation

Rowlinson P (1987) A deletion-contraction algorithm for the characteristic polynomial of a multigraph. Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 105 (1), pp. 153-160. https://doi.org/10.1017/S0308210500021983

Abstract
The characteristic polynomial of a finite multigraph G is expressed in terms of characteristic polynomials oflocal modifications of G. The resulting formula is used to investigate the largest eigenvalues of certain theta graphs.

Journal
Proceedings of the Royal Society of Edinburgh: Section A Mathematics: Volume 105, Issue 1