A new approach to the bipartite fundamental bound
type: Item
instance of: scholarly article
title: A new approach to the bipartite fundamental bound
zbMATH Open document ID: 1254.05054
published in: Discrete Mathematics
publication date: 2012-10-16T00:00:00Z
review text: The author defined taut graphs as bipartite distance regular graphs that satisfy an inequality proved in [\textit{M. S. MacLean}, Discrete Math 225, No. 1--3, 193--216 (2000; Zbl 1001.05124)]. Here the author gives a new linear-algebraic characterization of taut graphs.
reviewed by: Dragan Stevanović
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 6093932
zbMATH Keywords: distance regular graph
zbMATH Keywords: association scheme
zbMATH Keywords: bipartite graph
zbMATH Keywords: taut graph
author: Mark S. MacLean
MaRDI profile type: Publication
full work available at URL: j.disc.2012.07.014
OpenAlex ID: W2006363510
cites work: Q3218140
cites work: Q3992965
cites work: 2-homogeneous bipartite distance-regular graphs
cites work: Problems in algebraic combinatorics
cites work: Tight distance-regular graphs
cites work: An inequality involving two eigenvalues of a bipartite distance-regular graph
cites work: Taut distance-regular graphs of odd diameter
cites work: Taut distance-regular graphs and the subconstituent algebra
cites work: The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two
cites work: Homogeneous graphs and regular near polygons
DOI: 10.1016/J.DISC.2012.07.014
description: scientific article; zbMATH DE number 6093932