标题： Shrikhande图的设计谱 显示英文标题

标题： The design spectrum of the Shrikhande graph

摘要： 一个简单图$G$的设计谱是满足存在完全图$K_n$的边分解为$n(n - 1)/(2 |E(G)|)$个$G$的正整数$n$的集合。 本文的目的是证明 Shrikhande 图和$K_{4,4}$的线图具有设计谱$\{96t + 1: t = 1, 2, \dots\}$。 显示英文摘要

摘要： The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. The purpose of this short paper is to prove that the Shrikhande graph and the line graph of $K_{4,4}$ have the design spectrum $\{96t + 1: t = 1, 2, \dots\}$.