On commutative association schemes and associated (directed) graphs

被引：0
|
作者：
Monzillo, Giusy [1 ]
Penjić, Safet [2 ]
机构：
[1] Faculty of Mathematics, Natural Sciences and Information Technologies, University of Primorska, Muzejski trg 2, Koper,6000, Slovenia
[2] Faculty of Mathematics, Natural Sciences and Information Technologies, Andrej Marušič Institute, University of Primorska, Muzejski trg 2, Koper,6000, Slovenia
来源：
arXiv | 2023年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Matrix algebra
引用
收藏
相关论文
共 15 条
  • [11] A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
    Lingas, Andrzej
    Sledneu, Dzmitry
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7147 LNCS : 373 - 384
  • [12] A modular absolute bound condition for primitive association schemes
    Hanaki, Akihide
    Ponomarenko, Ilia
    Journal of Algebraic Combinatorics, 2009, 29 (04): : 447 - 456
  • [13] Linear time algorithms for two disjoint paths problems on directed acyclic graphs
    Institut für Informatik, Universität Augsburg, 86135 Augsburg, Germany
    Theor Comput Sci, (35-48):
  • [14] Upper ideal relation graphs associated to rings
    Baloda, Barkha
    Kumar, Jitender
    Soft Computing, 28 (19): : 10815 - 10826
  • [15] Non-commutative graphs based on finite-infinite system couplings: Quantum error correction for a qubit coupled to a coherent field
    Amosov, G.G.
    Mokeev, A.S.
    Pechen, A.N.
    arXiv, 2021,
12