Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
type: Item
instance of: scholarly article
title: Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
zbMATH Open document ID: 1182.05132
author: Kris Coolsaet
author: Aleksandar Jurišić
published in: Journal of Combinatorial Theory. Series A
publication date: 2008-09-04T00:00:00Z
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 5321273
zbMATH Keywords: Krein parameters
zbMATH Keywords: association scheme
zbMATH Keywords: distance-regular graph
zbMATH Keywords: strongly regular graph
zbMATH Keywords: triple intersection numbers
MaRDI profile type: Publication
full work available at URL: j.jcta.2007.12.001
OpenAlex ID: W2049971834
cites work: Q3992965
cites work: Strongly regular graphs having strongly regular subconstituents
cites work: Q4000288
cites work: Q4033705
cites work: Krein parameters and antipodal tight graphs with diameter 3 and 4
cites work: Tight distance-regular graphs
cites work: Q4168944
cites work: Q3720610
cites work: Kite-free distance-regular graphs
DOI: 10.1016/J.JCTA.2007.12.001
Recommended article: ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR GRAPHS
Recommended article: Nonexistence of a class of distance-regular graphs
Recommended article: On distance-regular graphs with \(k_ i=k_ j\)
Recommended article: Using symbolic computation to prove nonexistence of distance-regular graphs
Recommended article: A new condition for distance-regular graphs
Recommended article: Some inequalities in distance-regular graphs
Recommended article: A new inequality for distance-regular graphs
Recommended article: A new feasibility condition for distance-regular graphs
Recommended article: Q3765819
Recommended article: On distance-regular graphs with \(k_ i= k_ j\). II
description: scientific article; zbMATH DE number 5321273