Cospectral graphs and the generalized adjacency matrix
Let \(J\) be the all-ones matrix, and let \(A\) denote the adjacency matrix of a graph. It is known that if two graphs are cospectral with respect to \(yJ-A\) for two distinct values of \(y\), then they are cospectral for all \(y\). In this paper the authors focus on \(\hat y\)-cospectral graphs, which are graphs cospectral with respect to \(yJ-A\) for exactly one value \(\hat y\) of \(y\). They prove that such a \(\hat y\) must always be a rational number and prove existence of a pair of \(\hat y\)-cospectral graphs for every rational \(\hat y\). A computer construction has been used to generate all \(\hat y\)-cospectral graph pairs on at most nine vertices and also all pairs of \(\hat y\)-cospectral graph pairs on at most eleven vertices for all rational \(\hat y\in(0,1)\), where one graph is regular and the other one is not.
- A note on non-\(\mathbb{R}\)-cospectral graphs
- Regularity and the generalized adjacency spectra of graphs
- Generalized cospectral graphs with and without Hamiltonian cycles
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
- Cospectral constructions for several graph matrices using cousin vertices
- A note on cospectral graphs
- Eigenspaces of graphs
- Enumeration of cospectral graphs.
- scientific article; zbMATH DE number 3739586 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- nauty
- Regularity and the generalized adjacency spectra of graphs
- Which graphs are determined by their spectrum?
- Developments on spectral characterizations of graphs
- Enumeration of cospectral graphs.
- Weakly cospectral graphs
- Interlacing eigenvalues and graphs
- Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
- On the expressive power of linear algebra on graphs
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
- On cospectrality of gain graphs
- Cospectral constructions for several graph matrices using cousin vertices
- Cospectrality of graphs with respect to distance matrices
- Comparing large-scale graphs based on quantum probability theory
- Generalized permanental polynomials of graphs
- Generalized cospectral graphs with and without Hamiltonian cycles
- A new method for constructing graphs determined by their generalized spectrum
- On the least distance eigenvalue and its applications on the distance spread
- Complete multipartite graphs are determined by their distance spectra
- Regularity and the generalized adjacency spectra of graphs
- Main Q-eigenvalues and generalized Q-cospectrality of graphs
- Graphs with at most one generalized cospectral mate
- On the second largest distance eigenvalue of a graph
- Two Laplacians for the distance matrix of a graph
- scientific article; zbMATH DE number 15498 (Why is no real title available?)
- Spectral characterizations of almost complete graphs
- On the expressive power of linear algebra on graphs
- Connected graphs cospectral with a friendship graph
- A note on non-\(\mathbb{R}\)-cospectral graphs
- Distance Laplacian spectra of graphs: a survey
- Distance signless Laplacian spectra of graphs: a survey
- On a hierarchy of spectral isomorphism invariants
- On a hierarchy of spectral invariants for graphs
- Distinguishing graphs by their spectra, Smith normal forms and complements
- Degree-similar graphs and cospectral graphs
This page was built for publication: Cospectral graphs and the generalized adjacency matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876300)
