The distance Laplacian spectral radius of unicyclic graphs

Bo Zhou; Hongying Lin

REVIEW

The distance Laplacian spectral radius of unicyclic graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1707.08685 v1 pith:IV2MJLP6 submitted 2017-07-27 math.CO

The distance Laplacian spectral radius of unicyclic graphs

Hongying Lin , Bo Zhou This is my paper

classification math.CO

keywords distancelaplacianradiusspectralgraphsmatrixmathcalunicyclic

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

For a connected graph $G$, the distance Laplacian spectral radius of $G$ is the spectral radius of its distance Laplacian matrix $\mathcal{L}(G)$ defined as $\mathcal{L}(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.

The distance Laplacian spectral radius of unicyclic graphs

discussion (0)