Association Schemes

Association Schemes is a combinatorial structure consisting of a partition of the edge set of a complete graph into relations that satisfy regularity conditions, distinguished by the property that the number of vertices related to any two given vertices depends only on their relation class, thereby forming a highly symmetric configuration used in algebraic combinatorics.

258

Publications

10K

Citations

367

Authors

234

Institutions

Publications per year

2017–2026

42

Authors

367

  1. AH
    Akihide Hanaki

    Shinshu University, Japan

    16 publications · 294 citations

    13

    h-index

  2. MM
    Mikhail Muzychuk

    Netanya Academic College, Israel

    12 publications · 313 citations

    11

    h-index

  3. EB
    Eiichi Bannaĭ

    Kyushu University, Japan

    10 publications · 267 citations

    10

    h-index

  4. BX
    Bangteng Xu

    Eastern Kentucky University, United States

    8 publications · 151 citations

    8

    h-index

  5. WJ
    William J. Martin

    Indiana University – Purdue University Indianapolis, United States

    8 publications · 318 citations

    8

    h-index

1–5 of 367

Venues

  1. Journal of Combinatorial Theory Series A

    20 publications · 693 citations

    15

    h-index

  2. European Journal of Combinatorics

    20 publications · 463 citations

    13

    h-index

  3. Journal of Algebra

    18 publications · 367 citations

    13

    h-index

  4. Discrete Mathematics

    13 publications · 201 citations

    11

    h-index

  5. The Annals of Mathematical Statistics

    11 publications · 626 citations

    10

    h-index

1–5