The normalized distance Laplacian

DOI10.1515/spma-2020-0114zbMath1458.05154arXiv1903.04575OpenAlexW3123727480MaRDI QIDQ2663695

Carolyn Reinhart

Publication date: 19 April 2021

Published in: Special Matrices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.04575

zbMATH Keywords

cospectralitynormalized Laplaciandistance matricesgeneralized characteristic polynomial

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Related Items (6)

The bipartite Laplacian matrix of a nonsingular tree ⋮ Exploring normalized distance Laplacian eigenvalues of the zero-divisor graph of ring \(\mathbb{Z}_n\) ⋮ Unnamed Item ⋮ On spectra of distance Randić matrix of graphs ⋮ On the normalized distance Laplacian eigenvalues of graphs ⋮ On the normalized (distance) Laplacian spectrum of linear dependence graph of a finite-dimensional vector space

Cites Work

• Unnamed Item
• Unnamed Item
• A cospectral family of graphs for the normalized Laplacian found by toggling
• Two Laplacians for the distance matrix of a graph
• Constructing cospectral graphs
• Graphs determined by their generalized characteristic polynomials
• A construction of cospectral graphs for the normalized Laplacian
• Enumeration of cospectral graphs.
• Addressing the Petersen graph
• Distance spectra of graphs: a survey
• Cospectrality of graphs with respect to distance matrices
• A construction of distance cospectral graphs
• An eigenvalue bound for the Laplacian of a graph
• Graphs that are cospectral for the distance Laplacian
• Using twins and scaling to construct cospectral graphs for the normalized Laplacian
• On the Addressing Problem for Loop Switching

This page was built for publication: The normalized distance Laplacian