arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.10467math.CO
收藏

图的非对称指数

The Asymmetric Index of a Graph

Alejandra Brewer, Adam Gregory, Quindel Jones, Darren A. Narayan

摘要:

一个图$G$是不对称的,如果它的顶点自同构群是平凡的.不对称图是由Erdens和Rényi在1963年提出的,他们测量了不对称图的不对称程度。他们证明了任何不对称图都可以通过去掉一定数量的边$r$和/或增加一定数量的边$s$而成为非不对称图,并定义了图的不对称度为$r+s$的最小值。在本文中,我们定义了另一个性质,如何接近一个给定的非对称图是不对称的。为了将图$G$转化为非对称图,我们定义图$G$的非对称指数为$r+s$的最小值,记为$ai(G)$.

英文摘要:

A graph $G$ is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963 where they measured the degree of asymmetry of an asymmetric graph. They proved that any asymmetric graph can be made non-asymmetric by removing some number $r$ of edges and/or adding adding some number $s$ of edges, and defined the degree of asymmetry of a graph to be the minimum value of $r+s$. In this paper, we define another property that how close a given non-asymmetric graph is to being asymmetric. We define the asymmetric index of a graph $G$, denoted $ai(G)$, to be the minimum of $r+s$ in order to change $G$ into an asymmetric graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑