Campus Units

Mathematics

Document Type

Article

Publication Version

Submitted Manuscript

Publication Date

2016

Journal or Book Title

Linear Algebra and its Applications

Volume

497

First Page

66

Last Page

87

DOI

10.1016/j.laa.2016.02.018

Abstract

The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. The distance eigenvalues of G are the eigenvalues of its distance matrix and they form the distance spectrum of G. We determine the distance spectra of double odd graphs and Doob graphs, completing the determination of distance spectra of distance regular graphs having exactly one positive distance eigenvalue. We characterize strongly regular graphs having more positive than negative distance eigenvalues. We give examples of graphs with few distinct distance eigenvalues but lacking regularity properties. We also determine the determinant and inertia of the distance matrices of lollipop and barbell graphs.

Comments

This is a manuscript of an article from Linear Algebra and its Applications 497 (2016): 66, doi:10.1016/j.laa.2016.02.018. Posted with permission.

Rights

This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/

Copyright Owner

Elsevier Inc.

Language

en

File Format

application/pdf

Published Version

Share

COinS