Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
type: Item
instance of: scholarly article
title: Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
zbMATH Open document ID: 0506.05053
DOI: 10.1016/0095-8956(82)90040-5
author: Aeryung Moon
published in: Journal of Combinatorial Theory. Series B
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05B30
zbMATH DE Number: 3797804
zbMATH Keywords: distance regular graph
zbMATH Keywords: graph of Johnson scheme
MaRDI profile type: Publication
full work available at URL: 0095-8956(82)90040-5
OpenAlex ID: W1997036024
cites work: On the tetrahedral graph
cites work: A characterization problem in graph theory
cites work: Q4770409
cites work: A characterization of tetrahedral graphs
cites work: Q5707657
cites work: On the uniqueness of the tetrahedral association schemes
cites work: Characterization of the odd graphs \(O_ k \)by parameters
cites work: On a Characterization of the Triangular Association Scheme
description: scientific article; zbMATH DE number 3797804