A note on cospectral graphs

From MaRDI portal
Publication:1138002

DOI10.1016/0095-8956(80)90058-1zbMath0431.05021OpenAlexW2000173816MaRDI QIDQ1138002

Charles R. Johnson, Morris Newman

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90058-1




Related Items

Adjacency MatricesSpectral characterization of multicone graphsSpectral characterizations of tournamentsCodeterminantal graphsThe idiosyncratic polynomial of digraphsOn eigenvector structure of weakly balanced networksThe Second Immanantal Polynomial and the Centroid of a GraphCospectral graphs and the generalized adjacency matrixTwo Laplacians for the distance matrix of a graphControllable subsets in graphsZeta-equivalent digraphs: simultaneous cospectralitySpectral characterizations of almost complete graphsGeneralized spectral characterizations of regular graphs based on graph-vectorsSmith normal form and the generalized spectral characterization of oriented graphsThe line graphs of lollipop graphs are determined by their spectraGraphs with at most one generalized cospectral mateWhich graphs are determined by their spectrum?Permanental polynomials of graphsEnumeration of cospectral graphs.Generalized spectral characterization of mixed graphsThe overgraphs of generalized cospectral controllable graphsA note on non-\(\mathbb{R}\)-cospectral graphsRegularity and the generalized adjacency spectra of graphsUnnamed ItemCospectrality of graphs with respect to distance matricesOriented graphs determined by their generalized skew spectrumGeneralized spectral characterizations of almost controllable graphsOn the expressive power of linear algebra on graphsOn the distance signless Laplacian of a graphDevelopments on spectral characterizations of graphsDevelopments in the theory of graph spectraGraph isomorphism and equality of simplicesGeneralized cospectral graphs with and without Hamiltonian cyclesSmith normal form and the generalized spectral characterization of graphsOn the Polynomials of GraphsAn improved condition for a graph to be determined by its generalized spectrumDistinguishing graphs with zeta functions and generalized spectraMain Q-eigenvalues and generalized Q-cospectrality of graphs



Cites Work