Characteristic Polynomial Analysis on Matrix Representations of Graphs

DOI10.1007/978-3-642-02124-4_25zbMath1247.05158OpenAlexW1523858677WikidataQ60431119 ScholiaQ60431119MaRDI QIDQ3637704

Edwin R. Hancock, Peng Ren, Richard C. Wilson

Publication date: 14 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02124-4_25

zbMATH Keywords

adjacency matrixLaplacian matrixIhara zeta functionoriented line graphcharacteristic polynomial coefficientsdiscrite time quantum walkmatrix representations of graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Pattern recognition, speech recognition (68T10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quantum stochastic calculus (81S25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

The graph matching problem

Cites Work

• Unnamed Item
• Spectral embedding of graphs.
• Graph characteristics from the heat kernel trace
• Coined quantum walks lift the cospectrality of graphs and trees
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• Quantum walks on graphs

This page was built for publication: Characteristic Polynomial Analysis on Matrix Representations of Graphs