A note on cospectral graphs
From MaRDI portal
Cites work
- An Efficient Algorithm for Graph Isomorphism
- Cospectral Graphs and Digraphs
- 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?)
- 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
(65)- Developments on spectral characterizations of graphs
- Graph isomorphism and equality of simplices
- Permanental polynomials of graphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Controllable subsets in graphs
- Oriented graphs determined by their generalized skew spectrum
- Generalized spectral characterizations of almost controllable graphs
- On the expressive power of linear algebra on graphs
- Smith normal form and the generalized spectral characterization of graphs
- An improved condition for a graph to be determined by its generalized spectrum
- Spectral characterizations of tournaments
- Codeterminantal graphs
- The idiosyncratic polynomial of digraphs
- On eigenvector structure of weakly balanced networks
- Zeta-equivalent digraphs: simultaneous cospectrality
- Generalized spectral characterization of mixed graphs
- Cospectrality of graphs with respect to distance matrices
- Generalized cospectral graphs with and without Hamiltonian cycles
- Distinguishing graphs with zeta functions and generalized spectra
- The line graphs of lollipop graphs are determined by their spectra
- Regularity and the generalized adjacency spectra of graphs
- Main Q-eigenvalues and generalized Q-cospectrality of graphs
- Generalized spectral characterizations of regular graphs based on graph-vectors
- Graphs with at most one generalized cospectral mate
- On the distance signless Laplacian of a graph
- Spectral characterization of multicone graphs
- On the Polynomials of Graphs
- Adjacency Matrices
- The Second Immanantal Polynomial and the Centroid of a Graph
- Two Laplacians for the distance matrix of a graph
- Spectral characterizations of almost complete graphs
- Developments in the theory of graph spectra
- On the expressive power of linear algebra on graphs
- A note on non-\(\mathbb{R}\)-cospectral graphs
- Smith normal form and the generalized spectral characterization of oriented graphs
- An improved condition for a family of trees being determined by their generalized spectrum
- Rational orthogonal matrices and isomorphism of graphs
- Generalized distance spectral characterizations of graphs based on Smith norm form
- Distance Laplacian spectra of graphs: a survey
- The overgraphs of generalized cospectral controllable graphs
- Distance signless Laplacian spectra of graphs: a survey
- Annihilating polynomial, Jordan canonical form, and generalized spectral characterizations of Eulerian graphs
- Graph isomorphism and multivariate graph spectrum
- Counting cospectral graphs obtained via switching
- On a hierarchy of spectral isomorphism invariants
- A characterization of generalized cospectrality of rooted graphs with applications in graph reconstruction
- Degree-similar graphs
- On a hierarchy of spectral invariants for graphs
- Cospectral graphs obtained by edge deletion
- Generalized spectral characterization of signed bipartite graphs
- Primary decomposition theorem and generalized spectral characterization of graphs
- Generating all regular rational orthogonal matrices
- The automorphism group and plain eigenvalues of a graph
- Haemers’ Conjecture: An Algorithmic Perspective
- A new criterion for oriented graphs to be determined by their generalized skew spectrum
- Mixed graphs determined by their generalized Hermitian adjacency spectrum based on Eisenstein integers
- Generalized spectral characterization of signed trees
- Distinguishing graphs by their spectra, Smith normal forms and complements
- Constructing adjacency and distance cospectral graphs via regular rational orthogonal matrix
- Smith normal form and the generalized spectral characterization of a type of symmetric matrices
- Generalized block diagonal Laplacian spectrum of graphs
- On a generalization of the Johnson-Newman theorem to multiple rank-one perturbations
- Degree-similar graphs and cospectral graphs
- Cospectral graphs and the generalized adjacency matrix
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)
