The Distance Laplacian Spectral Radius of Clique Trees
The Distance Laplacian Spectral Radius of Clique Trees
The distance Laplacian matrix of a connected graph <math xmlns="http://www.w3.org/1998/Math/MathML" id="M1"> <mi>G</mi> </math> is defined as <math xmlns="http://www.w3.org/1998/Math/MathML" id="M2"> <mi mathvariant="normal">ℒ</mi> <mfenced open="(" close=")" separators="|"> <mrow> <mi>G</mi> </mrow> </mfenced> <mo>=</mo> <mtext>Tr</mtext> <mfenced open="(" close=")" separators="|"> <mrow> <mi>G</mi> </mrow> </mfenced> <mo>−</mo> <mi>D</mi> <mfenced open="(" close=")" separators="|"> <mrow> <mi>G</mi> </mrow> </mfenced> </math> …