An eigenvalue characterization of antipodal distance-regular graphs
type: Item
instance of: scholarly article
title: An eigenvalue characterization of antipodal distance-regular graphs
zbMATH Open document ID: 0885.05082
author: J. Ning
published in: The Electronic Journal of Combinatorics
publication date: 1998-02-15T00:00:00Z
full work available at URL: https://eudml.org/doc/119257
full work available at URL: v4i1r30.html
review text: Summary: Let \(\Gamma\) be a regular (connected) graph with \(n\) vertices and \(d+1\) distinct eigenvalues. As a main result, it is shown that \(\Gamma\) is an \(r\)-antipodal distance-regular graph if and only if the distance graph \(\Gamma_d\) is constituted by disjoint copies of the complete graph \(K_r\), with \(r\) satisfying an expression in terms of \(n\) and the distinct eigenvalues.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 1118014
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1118014