The distance Laplacian spectral radius of unicyclic graphs

DOI10.1016/J.DAM.2016.11.011MaRDI QIDQ6289488arXivFDO

Authors Hongying Lin, Bo Zhou

Publication date 26 July 2017

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Abstract: For a connected graph $G$, the distance Laplacian spectral radius of $G$ is the spectral radius of its distance Laplacian matrix $mathcalL(G)$ defined as $mathcalL(G)=Tr(G)-D(G)$, where $Tr(G)$ is a diagonal matrix of vertex transmissions of $G$ and $D(G)$ is the distance matrix of $G$. In this paper, we determine the unique graphs with maximum distance Laplacian spectral radius among unicyclic graphs.

This page was built for publication: The distance Laplacian spectral radius of unicyclic graphs

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