Reconstruction of weighted graphs by their spectrum

DOI10.1006/eujc.1999.0410zbMath0964.05046OpenAlexW2018886572MaRDI QIDQ1580674

Lorenz Halbeisen, Norbert Hungerbühler

Publication date: 8 July 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/406fd3d0d80e9284e27e91b4a303e0ea0f1d0fc3

zbMATH Keywords

weighted graphreconstructionLaplace spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Statistical Analysis of Random Objects Via Metric Measure Laplacians, Which graphs are determined by their spectrum?

Cites Work

• Almost all trees share a complete set of immanantal polynomials
• The Laplacian Spectrum of a Graph
• A Sufficient Condition for All the Roots of a Polynomial To Be Real
• Generation of isospectral graphs
• The Laplacian Spectrum of a Graph II
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item