Some spectral and quasi-spectral characterizations of distance-regular graphs

Aida Abiad Monge, Edwin van Dam, M.A. Fiol

Research output: Contribution to journalArticleScientificpeer-review

3 Citations (Scopus)

Abstract

In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using the preintersection numbers we give some new spectral and quasi-spectral characterizations of distance-regularity, in particular for graphs with large girth or large odd-girth.
Original languageEnglish
Pages (from-to)1-18
JournalJournal of Combinatorial Theory, Series A, Structures designs and application combinatorics
Volume143
DOIs
Publication statusPublished - Oct 2016

Keywords

  • distance-regular graph
  • Eigenvalues
  • girth
  • odd-girth
  • preintersection numbers

Fingerprint Dive into the research topics of 'Some spectral and quasi-spectral characterizations of distance-regular graphs'. Together they form a unique fingerprint.

  • Cite this