The complements of path and cycle are determined by their distance (signless) Laplacian spectra

Jie Xue, Shuting Liu and Jinlong Shu

Applied Mathematics and Computation, 2018, vol. 328, issue C, 137-143

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.

Keywords: Cospectrality; Distance Laplacian matrix; Distance signless Laplacian matrix (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318300559
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:328:y:2018:i:c:p:137-143

DOI: 10.1016/j.amc.2018.01.034

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().