<p>In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with a unique non-trivial ideal.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal

  • Anwita Bhowmik,
  • Sergey Goryainov

摘要

In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with a unique non-trivial ideal.