The inertia of distance matrices of some graphs

10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Let D denote the distance matrix of a connected graph G. The inertia of D is the triple of integers (n+(D), n0(D), n-(D)), where n+(D), n0(D), n-(D) denote the number of positive, 0, and negative eigenvalues of D, respectively. In this paper, we mainly give some graphs whose n+(D) is equal to 1 and get the inertia of their distance matrices. © 2013 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Zhanga, X., & Godsil, C. (2013). The inertia of distance matrices of some graphs. Discrete Mathematics, 313(16), 1655–1664. https://doi.org/10.1016/j.disc.2013.04.013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free