A deletion-contraction algorithm for the characteristic polynomial of a multigraph
From MaRDI portal
Publication:3204505
DOI10.1017/S0308210500021983zbMath0717.05064OpenAlexW2325736576MaRDI QIDQ3204505
Publication date: 1987
Published in: Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0308210500021983
Related Items
The first few unicyclic and bicyclic hypergraphs with largest spectral radii, A study of eigenspaces of graphs, The characteristic polynomials of modified graphs, A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients, On Hamiltonian graphs with maximal index, Small Mahler Measures From Digraphs, On the index of tricyclic Hamiltonian graphs, A survey of automated conjectures in spectral graph theory, Combinatorial approach for computing the characteristic polynomial of a matrix, The largest eigenvalue of a graph: A survey
Cites Work
