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

DOI10.1017/S0308210500021983MaRDI QIDQ3204505zbMATH OpenOpenAlexFDO

Authors P. Rowlinson

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

zbMATH Keywords

multigraph

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 165464
• scientific article; zbMATH DE number 125495
• scientific article; zbMATH DE number 3966122
• A contraction theorem for the largest eigenvalue of a multigraph
• Contraction-deletion invariants for graphs

Cited in

(15)

• On Hamiltonian graphs with maximal index
• A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
• A contraction theorem for the largest eigenvalue of a multigraph
• The characteristic polynomials of modified graphs
• A reduction formula for the characteristic polynomial of hypergraph with pendant edges
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• A study of eigenspaces of graphs
• scientific article; zbMATH DE number 6704650 (Why is no real title available?)
• GlobaL analysis of the deiete-contract recursion for graphs and matroids
• On the index of tricyclic Hamiltonian graphs
• The largest eigenvalue of a graph: A survey
• Small Mahler Measures From Digraphs
• Cubic graphs with no eigenvalues in the interval (-1,1)
• Combinatorial approach for computing the characteristic polynomial of a matrix
• A survey of automated conjectures in spectral graph theory

This page was built for publication: A deletion-contraction algorithm for the characteristic polynomial of a multigraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204505)