Cospectrality of graphs with respect to distance matrices

Mustapha Aouchiche, Pierre Hansen

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)

Abstract

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph G are the spectra of the distance, distance Laplacian and distance signless Laplacian matrices of G. Two graphs are said to be cospectral with respect to the distance (resp. distance Laplacian or distance signless Laplacian) matrix if they share the same distance (resp. distance Laplacian or distance signless Laplacian) spectrum. If a graph G does not share its spectrum with any other graph, we say G is determined by its spectrum. In this paper we are interested in the cospectrality with respect to the three distance matrices. First, we report on a numerical study in which we looked into the spectra of the distance, distance Laplacian and distance signless Laplacian matrices of all the connected graphs on up to 10 vertices. Then, we prove some theoretical results about what we can deduce about a graph from these spectra. Among other results we identify some of the graphs determined by their distance Laplacian or distance signless Laplacian spectra.

Original languageEnglish
Pages (from-to)309-321
Number of pages13
JournalApplied Mathematics and Computation
Volume325
DOIs
Publication statusPublished - May 15 2018
Externally publishedYes

Keywords

  • Cospectrality
  • Distance matrices
  • Graph
  • Laplacian
  • Signless Laplacian
  • Spectra

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Cospectrality of graphs with respect to distance matrices'. Together they form a unique fingerprint.

Cite this