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.
%0 Journal Article
%1 rowlinson87
%A Rowlinson, Peter
%D 1987
%I Royal Society of Edinburgh Scotland Foundation
%J Proceedings of the Royal Society of Edinburgh: Section A Mathematics
%K characteristic graph.theory no.pdf polynomial recurrence
%N 1
%P 153–-160
%R 10.1017/S0308210500021983
%T A Deletion-Contraction Algorithm for the Characteristic Polynomial of a Multigraph
%V 105
%X 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.
@article{rowlinson87,
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.},
added-at = {2016-12-16T10:31:29.000+0100},
author = {Rowlinson, Peter},
biburl = {https://www.bibsonomy.org/bibtex/2613d191373e6dbecd48f4b446fd4478a/ytyoun},
doi = {10.1017/S0308210500021983},
interhash = {b1666ddbef91e9acfd21fe7e72f4b20b},
intrahash = {613d191373e6dbecd48f4b446fd4478a},
journal = {Proceedings of the Royal Society of Edinburgh: Section A Mathematics},
keywords = {characteristic graph.theory no.pdf polynomial recurrence},
month = jan,
number = 1,
pages = {153–-160},
place = {Edinburgh, UK},
publisher = {Royal Society of Edinburgh Scotland Foundation},
timestamp = {2017-03-14T22:57:13.000+0100},
title = {A Deletion-Contraction Algorithm for the Characteristic Polynomial of a Multigraph},
volume = 105,
year = 1987
}