Open AccessOn the distance spectrum of windmill graphs
Author(s) -
Zhiping Wang,
Jiaxue Xu,
Xiaojing Xu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1592/1/012056
Subject(s) - algorithm , artificial intelligence , computer science
The distance Laplacian matrix and the distance signless Laplacian matrix of a connected graph G are defined by L D (G) = Tr G −D(G) and Q D (G) = Tr G + D(G) . By a harmonious labelings of vertex set, the distance matrix of windmill graphs K n ( m ) is described as a block matrix. In this paper, we obtain the eigenvalues and the corresponding eigenvectors of the distance matrix, the distance Laplacian matrix and the distance signless Laplacian matrix of windmill graphs K n ( m ) .