A note on cospectral graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3480615 (Why is no real title available?)
- scientific article; zbMATH DE number 3553751 (Why is no real title available?)
- scientific article; zbMATH DE number 3585485 (Why is no real title available?)
- An Efficient Algorithm for Graph Isomorphism
- Cospectral Graphs and Digraphs
- On a Characterization of the Triangular Association Scheme
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- Spektren endlicher Grafen
- The characteristic polynomial of a graph
Cited in
(42)- On the expressive power of linear algebra on graphs
- Main Q-eigenvalues and generalized Q-cospectrality of graphs
- Adjacency Matrices
- Generalized distance spectral characterizations of graphs based on Smith norm form
- An improved condition for a graph to be determined by its generalized spectrum
- On the expressive power of linear algebra on graphs
- Two Laplacians for the distance matrix of a graph
- Spectral characterizations of almost complete graphs
- Distinguishing graphs with zeta functions and generalized spectra
- Graphs with at most one generalized cospectral mate
- On eigenvector structure of weakly balanced networks
- Generalized spectral characterization of mixed graphs
- Cospectral graphs and the generalized adjacency matrix
- Developments on spectral characterizations of graphs
- The Second Immanantal Polynomial and the Centroid of a Graph
- Permanental polynomials of graphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Graph isomorphism and equality of simplices
- Oriented graphs determined by their generalized skew spectrum
- On the Polynomials of Graphs
- Spectral characterization of multicone graphs
- Controllable subsets in graphs
- Spectral characterizations of tournaments
- Regularity and the generalized adjacency spectra of graphs
- Generalized spectral characterizations of almost controllable graphs
- Cospectrality of graphs with respect to distance matrices
- The line graphs of lollipop graphs are determined by their spectra
- Generalized spectral characterizations of regular graphs based on graph-vectors
- Codeterminantal graphs
- Generalized cospectral graphs with and without Hamiltonian cycles
- The idiosyncratic polynomial of digraphs
- On the distance signless Laplacian of a graph
- Smith normal form and the generalized spectral characterization of oriented graphs
- Distance Laplacian spectra of graphs: a survey
- Zeta-equivalent digraphs: simultaneous cospectrality
- An improved condition for a family of trees being determined by their generalized spectrum
- Developments in the theory of graph spectra
- The overgraphs of generalized cospectral controllable graphs
- Rational orthogonal matrices and isomorphism of graphs
- A note on non-\(\mathbb{R}\)-cospectral graphs
- Smith normal form and the generalized spectral characterization of graphs
This page was built for publication: A note on cospectral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138002)
