Generation of isospectral graphs
From MaRDI portal
Publication:4256094
DOI<255::AID-JGT7>3.0.CO;2-6 10.1002/(SICI)1097-0118(199907)31:3<255::AID-JGT7>3.0.CO;2-6zbMath0932.05053OpenAlexW4249608996MaRDI QIDQ4256094
Lorenz Halbeisen, Norbert Hungerbühler
Publication date: 28 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199907)31:3<255::aid-jgt7>3.0.co;2-6
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Two Laplacians for the distance matrix of a graph ⋮ Construction of cospectral graphs ⋮ A geometric construction of isospectral magnetic graphs ⋮ Stronger arithmetic equivalence ⋮ Which graphs are determined by their spectrum? ⋮ Three distance characteristic polynomials of some graphs ⋮ A large family of cospectral Cayley graphs over dicyclic groups ⋮ A large family of cospectral Cayley graphs over dihedral groups ⋮ Cospectrality of graphs with respect to distance matrices ⋮ Some properties of the distance Laplacian eigenvalues of a graph ⋮ Reconstruction of weighted graphs by their spectrum
Cites Work
