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

Proceedings of the Royal Society of Edinburgh Section A: Mathematics - Tập 105 Số 1 - Trang 153-160 - 1987
Peter Rowlinson

Tóm tắt

SynopsisThe 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.

Từ khóa


Tài liệu tham khảo

Cvetković, 1986, Recent Results in the Theory of Graph Spectra

Sachs, 1985, Graphs, Hypergraphs and Applications, 73

Cvetković, 1979, Spectra of Graphs

Woodall, 1977, Combinatorial Surveys, 199

Wilson, 1979, Applications of Graph Theory

10.1090/S0002-9947-1946-0018401-4

10.1002/hlca.19530360125

Schwenk, 1974, Lecture Notes in Mathematics, 406, 153

Thông tin
Thông tin xuất bản

Proceedings of the Royal Society of Edinburgh Section A: Mathematics

Tập 105 Số 1

153-160

Thông tin tác giả