A new approach to the bipartite fundamental bound (Q456660): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:18, 5 March 2024

scientific article
Language Label Description Also known as
English
A new approach to the bipartite fundamental bound
scientific article

    Statements

    A new approach to the bipartite fundamental bound (English)
    0 references
    16 October 2012
    0 references
    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.
    0 references
    distance regular graph
    0 references
    association scheme
    0 references
    bipartite graph
    0 references
    taut graph
    0 references
    0 references

    Identifiers