On Isospectral Graphs.
From MaRDI portal
Publication:4241105
DOI10.4036/IIS.1998.117zbMATH Open0926.05027OpenAlexW2063831203MaRDI QIDQ4241105FDOQ4241105
Authors: Jinsong Tan
Publication date: 29 April 1999
Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4036/iis.1998.117
Recommendations
Cited In (36)
- Gelfand's inverse problem for the graph Laplacian
- Title not available (Why is that?)
- Isospectral graphs via inner symmetries
- Some properties of the distance Laplacian eigenvalues of a graph.
- Two Laplacians for the distance matrix of a graph
- Homotopy equivalence of isospectral graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A geometric construction of isospectral magnetic graphs
- Quantum graphs which sound the same
- Isospectral graph reductions and improved estimates of matrices' spectra
- Title not available (Why is that?)
- Isospectral graphs with identical nodal counts
- Laplacian and vibrational spectra for homogeneous graphs
- Constructing isospectral non-isomorphic digraphs from hypergraphs
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Hearing shapes viap-adic Laplacians
- Cospectrality of graphs with respect to distance matrices
- Title not available (Why is that?)
- Floquet isospectrality for periodic graph operators
- Title not available (Why is that?)
- Isospectral graphs and the representation-theoretical spectrum
- Isospectrality for graph Laplacians under the change of coupling at graph vertices: necessary and sufficient conditions
- On irreducible endospectral graphs
- Isospectral Kähler graphs
- Distance Laplacian spectra of graphs: a survey
- Non-isomorphic graphs with cospectral symmetric powers
- Title not available (Why is that?)
- Characterizing cospectral vertices via isospectral reduction
- Isospectral reduction in infinite graphs
- Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs
- The isospectral problem in graph theory
- Three distance characteristic polynomials of some graphs
- The isospectral fruits of representation theory: quantum graphs and drums
- An iterative construction of isospectral digraphs
This page was built for publication: On Isospectral Graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4241105)