Characteristic Polynomial Analysis on Matrix Representations of Graphs
From MaRDI portal
Recommendations
Cites work
- Coined quantum walks lift the cospectrality of graphs and trees
- Graph characteristics from the heat kernel trace
- scientific article; zbMATH DE number 1495995 (Why is no real title available?)
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- Quantum walks on graphs
- Spectral embedding of graphs.
Cited in
(11)- On the reconstruction of the characteristic polynomial of a graph
- Graph characterization by counting sink star subgraphs
- The graph matching problem
- A method to calculate the characteristic polynomials of a graph on n vertices by the aid of a computer
- Graph descriptors from B-matrix representation
- scientific article; zbMATH DE number 5671368 (Why is no real title available?)
- Characteristic polynomials and spectra of Boolean graphs
- scientific article; zbMATH DE number 7640508 (Why is no real title available?)
- scientific article; zbMATH DE number 7540090 (Why is no real title available?)
- Complete dynamical evaluation of the characteristic polynomial of binary quantum graphs
- Efficient computation of Ihara coefficients using the Bell polynomial recursion
This page was built for publication: Characteristic Polynomial Analysis on Matrix Representations of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637704)