Large families of laplacian isospectral graphs

DOI10.1080/03081089708818525zbMath0887.05036OpenAlexW2029928979MaRDI QIDQ4376560

Russell Merris

Publication date: 11 February 1998

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089708818525

zbMATH Keywords

eigenvaluesthreshold graphLaplacian matricesLaplacian isospectral graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (11)

On adjacency and Laplacian cospectral non-isomorphic signed graphs ⋮ Constructably Laplacian integral graphs ⋮ Two Laplacians for the distance matrix of a graph ⋮ On the Laplacian and signless Laplacian polynomials of graphs with semiregular automorphisms ⋮ A geometric construction of isospectral magnetic graphs ⋮ Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I ⋮ Which graphs are determined by their spectrum? ⋮ Three distance characteristic polynomials of some graphs ⋮ Cospectrality of graphs with respect to distance matrices ⋮ Some properties of the distance Laplacian eigenvalues of a graph ⋮ Laplacian graph eigenvectors

Cites Work

• Degree maximal graphs are Laplacian integral

This page was built for publication: Large families of laplacian isospectral graphs