Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes

被引：1
|
作者：
Kharaghani, Hadi [1 ]
Pender, Thomas [1 ]
Suda, Sho [2 ]
机构：
[1] Univ Lethbridge, Dept Math & Comp Sci, Lethbridge, AB T1K 3M4, Canada
[2] Natl Def Acad Japan, Dept Math, Yokosuka, Kanagawa 2398686, Japan
来源：
FINITE FIELDS AND THEIR APPLICATIONS | 2022年 / 83卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
Weighing matrix; Strongly regular graph; Divisible design graph; Balanced generalized weighing matrix; Association scheme;
D O I：
10.1016/j.ffa.2022.102065
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A weighing matrix W is quasi-balanced if |W ||W |(T) = |W |(T)|W | has at most two off-diagonal entries, where |W|(ij )= |W-ij|. A quasi-balanced weighing matrix W signs a strongly regular graph if |W| coincides with its adjacency matrix. Among other things, signed strongly regular graphs and their equivalent association schemes are presented. (C) 2022 Published by Elsevier Inc.
引用
收藏
页数：25
相关论文
共 50 条
12345