A study of graph spectra for comparing graphs and trees

DOI10.1016/j.patcog.2008.03.011zbMath1154.68505OpenAlexW2082119873MaRDI QIDQ937426

Ping Zhu, Richard C. Wilson

Publication date: 15 August 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.03.011

zbMATH Keywords

featuresspectrumshape representationgraph matchingtree matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items

Unnamed Item ⋮ Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance ⋮ Cospectrality of multipartite graphs ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ Predicting state transitions in brain dynamics through spectral difference of phase-space graphs ⋮ Spectral classes of regular, random, and empirical graphs ⋮ Cospectrality of complete bipartite graphs ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ On the spectrum of the normalized graph Laplacian ⋮ Network comparison and the within-ensemble graph distance ⋮ Towards a spectral theory of graphs based on the signless Laplacian. II. ⋮ Comparing large-scale graphs based on quantum probability theory ⋮ Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs ⋮ Graph spectra as a systematic tool in computational biology ⋮ Proof of a conjecture on spectral distance between cycles, paths and certain trees ⋮ Similarity, kernels, and the fundamental constraints on cognition

Uses Software

• COIL-100

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing cospectral graphs
• A Riemannian approach to graph embedding
• Retrieving articulated 3-D models using medial surfaces
• Subgraph isomorphism, matching relational structures and maximal cliques
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• An eigendecomposition approach to weighted graph matching problems
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• A distance measure between attributed relational graphs for pattern recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition