The complements of path and cycle are determined by their distance (signless) Laplacian spectra
type: Item
instance of: scholarly article
title: The complements of path and cycle are determined by their distance (signless) Laplacian spectra
zbMATH Open document ID: 1427.05142
author: Jie Xue
author: Shuting Liu
author: Jinlong Shu
published in: Applied Mathematics and Computation
publication date: 2019-07-10T00:00:00Z
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 7078853
zbMATH Keywords: cospectrality
zbMATH Keywords: distance Laplacian matrix
zbMATH Keywords: distance signless Laplacian matrix
MaRDI profile type: Publication
full work available at URL: j.amc.2018.01.034
OpenAlex ID: W2791637874
cites work: Two Laplacians for the distance matrix of a graph
cites work: Which graphs are determined by their spectrum?
cites work: Developments on spectral characterizations of graphs
cites work: Complete multipartite graphs are determined by their distance spectra
cites work: Hypercubes are determined by their distance spectra
cites work: The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)
cites work: On the second largest distance eigenvalue of a graph
cites work: The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
cites work: On the distance spectrum of graphs
cites work: On graphs with at least three distance eigenvalues less than \(-1\)
cites work: On the least distance eigenvalue and its applications on the distance spread
cites work: Remoteness and distance eigenvalues of a graph
cites work: The distance spectrum of complements of trees
cites work: Graphs with small diameter determined by their $D$-spectra
DOI: 10.1016/J.AMC.2018.01.034
description: scientific article; zbMATH DE number 7078853