| Article ID | Journal | Published Year | Pages | File Type | 
|---|---|---|---|---|
| 8901091 | Applied Mathematics and Computation | 2018 | 7 Pages | 
Abstract
												Let G be a connected graph with vertex set V(G) and edge set E(G). Let T(G) be the diagonal matrix of vertex transmissions of G and D(G) be the distance matrix of G. The distance Laplacian matrix of G is defined as L(G)=T(G)âD(G). The distance signless Laplacian matrix of G is defined as Q(G)=T(G)+D(G). In this paper, we show that the complements of path and cycle are determined by their distance (signless) Laplacian spectra.
											Related Topics
												
													Physical Sciences and Engineering
													Mathematics
													Applied Mathematics
												
											Authors
												Jie Xue, Shuting Liu, Jinlong Shu, 
											