Graphs that are cospectral for the distance Laplacian

zbMATH Open1444.05087arXiv1812.05734MaRDI QIDQ3299343FDOQ3299343

Authors: Boris Brimkov, Ken Duna, Kate J. Lorenzen, Carolyn Reinhart, Mark Yarrow, Leslie Hogben, S. Y. Song 

Publication date: 22 July 2020

Abstract: The distance matrix $mathcalD(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $mathcal{D}^L(G)=T(G)-mathcalD(G)$, where $T(G)$ is the diagonal matrix of row sums of $mathcalD(G)$. We establish several general methods for producing $mathcal{D}^L$-cospectral graphs that can be used to construct infinite families. We provide examples showing that various properties are not preserved by $mathcal{D}^L$-cospectrality, including examples of $mathcal{D}^L$-cospectral strongly regular and circulant graphs. We establish that the absolute values of coefficients of the distance Laplacian characteristic polynomial are decreasing, i.e., $|delt{a}_1^L|geqdotsgeq|delt{a}_n^L|$ where $delt{a}_k^L$ is the coefficient of $x^k$.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Cospectrality of graphs with respect to distance matrices
• \(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
• Some properties of the distance Laplacian eigenvalues of a graph.
• The normalized distance Laplacian
• Three distance characteristic polynomials of some graphs

zbMATH Keywords

unimodalitydistance Laplacian matrixcospectrality

Mathematics Subject Classification ID

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

Cites Work

• Distance-regular graphs the distance matrix of which has only one positive eigenvalue
• Distance spectra of graphs: a survey
• On the distance spectrum of distance regular graphs
• On the distance spectra of graphs
• Title not available (Why is that?)
• On the Addressing Problem for Loop Switching
• Constructing cospectral graphs
• Distance matrix polynomials of trees
• Two Laplacians for the distance matrix of a graph
• Partial difference sets
• Unimodality, log-concavity, real-rootedness and beyond
• Perfect state transfer in integral circulant graphs
• Distance spectra and distance energy of integral circulant graphs
• On the distance Laplacian spectra of graphs
• Title not available (Why is that?)
• On a conjecture of Graham and Lovász about distance matrices
• A construction of distance cospectral graphs
• Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree

Cited In (15)

• The graphs cospectral with the pineapple graph
• Cospectral constructions for several graph matrices using cousin vertices
• \(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
• A cospectral family of graphs for the normalized Laplacian found by toggling
• Constructions of cospectral graphs with different zero forcing numbers
• On cospectrality of gain graphs
• Enumeration of cospectral and coinvariant graphs
• Cospectrality of graphs with respect to distance matrices
• Codeterminantal graphs
• Distance Laplacian spectra of graphs: a survey
• Spectra of variants of distance matrices of graphs and digraphs: a survey
• The normalized distance Laplacian
• On the smallest eigenvalue of D_α-matrix of connected graphs
• A construction of distance cospectral graphs
• On the status sequences of trees

This page was built for publication: Graphs that are cospectral for the distance Laplacian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299343)