| 研究実績の概要 |
1. With Ponomarenko (Saint-Petersburg, the Steklov Institute of Mathematics) and Guo, Cai (Hainan University), we constructed exponentially many strongly regular graphs with bounded Weisfeiler-Leman dimension. The paper is under review.
2. With Suda (National Defence Academy), we showed that The paper is prepared for submission.
3. With Kabanov (Krasovskii Institute of Mathematics), we determined all strongly regular graphs that are decomposable into divisible design graphs and a Delsarte clique. The paper is prepared for submission.
4. With Abiad, Khramova (Eindhoven University), we computed a linear programmig bound for sum-rank-metric codes. The paper is prepared for submission.
|
| 今後の研究の推進方策 |
1. We plan to improve the Weisfeiler-Leman dimension of permutation graphs
and use this to to determine the Weisfeiler-Leman dimension of circular-arc
graphs without 3-coclique (joint with Ponomarenko, Nedela, Zeman).
2. We plan to study coherent configurations of Cartesian products of graphs.
This may help to improve linear programming bounds for sum-rank-metirc codes.
|
