Distance (signless) Laplacian spectra and energies of two classes of cyclic polyomino chains

Yonghong Zhang, Ligong Wang

Research output: Contribution to journalArticlepeer-review

Abstract

Let D(G) and Tr(G) be the distance matrix and the diagonal matrix of vertex transmissions of a graph G, respectively. The distance Laplacian matrix and the distance signless Laplacian matrix of G are defined as DL(G)=Tr(G)−D(G) and DQ(G)=Tr(G)+D(G), respectively. In this paper, we consider the distance Laplacian spectra and the distance signless Laplacian spectra of the linear cyclic polyomino chain Fn and the Möbius cyclic polyomino chain Mn. By utilizing the properties of circulant matrices, we give the characteristic polynomials and the eigenvalues for the distance Laplacian matrices and the distance signless Laplacian matrices of the graphs Fn and Mn, respectively. Furthermore, we provide the exactly values of the distance Laplacian energy and the distance signless Laplacian energy of the graph Fn, and the upper bounds on the distance Laplacian energy and the distance signless Laplacian energy of the graph Mn, respectively.

Original languageEnglish
Article number129099
JournalApplied Mathematics and Computation
Volume487
DOIs
StatePublished - 15 Feb 2025

Keywords

  • Characteristic polynomial
  • Circulant matrix
  • Distance Laplacian matrix
  • Energy
  • Polyomino chain
  • Spectrum

Cite this