Symmetries and symmetry-breaking in arithmetic graphs

算术图中的对称性和对称性破缺

阅读:1

Abstract

In this paper, we study symmetries and symmetry-breaking of the arithmetic graph of a composite number m, denoted by Am. We first study some properties such as the distance between vertices, the degree of a vertex and the number of twin classes in the arithmetic graphs. We describe symmetries of Am and prove that the automorphism group of Am is isomorphic to the symmetric group Sn of n elements, for m = ∏i=1npi. For symmetry-breaking, we study the concept of the fixing number of the arithmetic graphs and give exact formulae of the fixing number for the arithmetic graphs Am for m = ∏i=1npiri under different conditions on ri.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。