Distance-regular graphs with diameter 3 and eigenvalue a2 − c3

Quaid Iqbal, Jack H. Koolen, Jongyook Park, Masood Ur Rehman

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

In this paper, we consider the distance-regular graphs Γ whose distance-2 graphs Γ2 are strongly regular. Note that if Γ is bipartite, then its distance-2 graph is not connected. We first show that the distance-2 graph of a non-bipartite distance-regular graph with diameter 3 and eigenvalue a2−c3 is strongly regular, and then we give several kinds of classifications of non-bipartite distance-regular graphs with diameter 3 and eigenvalue a2−c3.

Original languageEnglish
Pages (from-to)271-290
Number of pages20
JournalLinear Algebra and Its Applications
Volume587
DOIs
StatePublished - 15 Feb 2020

Keywords

  • Distance-i graphs
  • Distance-regular graphs
  • Eigenvalues
  • Geometric
  • Strongly regular graphs

Fingerprint

Dive into the research topics of 'Distance-regular graphs with diameter 3 and eigenvalue a2 − c3'. Together they form a unique fingerprint.

Cite this