Three-class association schemes (Q1296390): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: van Dam, Edwin R. / rank
Normal rank
 
Property / author
 
Property / author: van Dam, Edwin R. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-designs having an intersection number \(k-n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Group Divisible Incomplete Block Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (49,16,3,6) strongly regular graph does not exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of antipodal distance-regular graphs related to the classical Preparata codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On groups with several doubly-transitive permutation representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-symmetric designs related to the triangular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs with four eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of distance-regular graphs with diameter three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small regular graphs with four eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Symmetric Designs (25,9,3) / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are 526,915,620 nonisomorphic one‐factorizations of K<sub>12</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4278702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of the proper and adjacency polynomials in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local adjacency polynomials to locally pseudo-distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance regular covers of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regularity and the spectrum of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs cospectral with distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spreads in strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherent algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank 5 association schemes and triality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On designs related to coherent configurations of type \((^ 2\;^ 2_ 4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a generalized quadrangle from its distance two association scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Polynomial of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3027027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudocyclic 3-class association schemes on 28 points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antipodal covers of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-factorizations of the complete graph—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Necessary Condition for Existence of Regular and Symmetrical Experimental Designs of Triangular Type, with Partially Balanced Incomplete Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete classification of symmetric (31, 10, 3) designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular two-graphs on 36 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an Application of Kronecker Product of Matrices to Statistical Designs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:22, 28 May 2024

scientific article
Language Label Description Also known as
English
Three-class association schemes
scientific article

    Statements

    Three-class association schemes (English)
    0 references
    2 August 1999
    0 references
    spectrum
    0 references
    Bose-Mesner algebra
    0 references
    Hoffman colorings
    0 references
    linked symmetric design
    0 references
    distance-regular graphs
    0 references
    association schemes
    0 references
    eigenvalues
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers