论文标题
关于强烈规则图的关键组及其概括的注释
A Note on the Critical Groups of Strongly Regular Graphs and Their Generalizations
论文作者
论文摘要
我们确定了强度正常的图的临界组中元素的最大顺序，并表明它由于Lorenzini而实现了频谱的结合。我们将结果扩展到所有图形，恰好是两个非零的拉普拉斯特征值，并研究了该问题的签名图。我们还研究了关键组上的单肌配对，并提出了一种使用配对来研究这些组的结构的方法。
We determine the maximum order of an element in the critical group of a strongly regular graph, and show that it achieves the spectral bound due to Lorenzini. We extend the result to all graphs with exactly two non-zero Laplacian eigenvalues, and study the signed graph version of the problem. We also study the monodromy pairing on the critical groups, and suggest an approach to study the structure of these groups using the pairing.
