Reconstruction of Weighted Graphs by their Spectrum
Authors:
- Lorenz HalbeisenLHLorenz Halbeisen
- Norbert HungerbühlerNHNorbert Hungerbühler
- 31 July 2000
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 21 (5) , 641-650
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Generation of isospectral graphsJournal of Graph Theory, 1999
- The Laplacian Spectrum of a Graph IISIAM Journal on Discrete Mathematics, 1994
- Almost all trees share a complete set of immanantal polynomialsJournal of Graph Theory, 1993
- A Sufficient Condition for All the Roots of a Polynomial To Be RealThe American Mathematical Monthly, 1992
- The Laplacian Spectrum of a GraphSIAM Journal on Matrix Analysis and Applications, 1990
- Configuration Statistics of Gaussian MoleculesMacromolecules, 1980
- Relation between the Coulson and Pauling bond ordersThe Journal of Chemical Physics, 1978
- Graph theory and the statistics and dynamics of polymer chainsThe Journal of Chemical Physics, 1976
- Generalized Matrix Functions and the Graph Isomorphism ProblemSIAM Journal on Applied Mathematics, 1968