VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Parameters of quotient-polynomial graphs
    Herman, Allen ; Maleki, Roghayeh
    Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We show that a collection ... of non-negative integer parameters of size ▫$d + \frac{d(d-1)}{2}$▫ is adequate for describing symmetric association schemes of class ▫$d$▫ that are generated by the adjacency matrix of their first non-trivial relation. We use this to generate a database of the corresponding quotient-polynomial graphs that have small valency and up to 6 classes, and among these find new feasible parameter sets for symmetric association schemes with noncyclotomic eigenvalues.
    Vir: Graphs and combinatorics. - ISSN 0911-0119 (Vol. 40, art. 60, 2024, str. 1-12)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2024
    Jezik - angleški
    COBISS.SI-ID - 194532355

    Povezava(-e):

    https://link.springer.com/article/10.1007/s00373-024-02789-2
    https://doi.org/10.1007/s00373-024-02789-2
    DOI

vir: Graphs and combinatorics. - ISSN 0911-0119 (Vol. 40, art. 60, 2024, str. 1-12)
loading ...
loading ...
loading ...

Vnos na polico