arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.04750math.CO
收藏

边传递图

Edge-Transitive Graphs

Heather A. Newman, Hector Miranda, Darren A. Narayan

摘要:

如果一个图的自同构群作用在它的边上是传递的,则称它是边传递的。已知边传递图是点传递图或二部图。本文给出了顶点数小于或等于$20$的连通边传递图的一个完全分类。然后,我们提出了一个无限族的边传递的二部图的建设,并使用此建设表明,存在一个非平凡的二部子图的$K_{m,n}$是连接和边传递时,$gcd(m,n)>2$。此外,我们调查的充要条件的连接$(r,2)$双正则子图的$K_{m,n}$,以及唯一性,并使用这些结果来解决的情况下,$gcd(m,n)=2$。然后,我们在点传递图中提出了无限族的边传递图,包括几类循环图。特别地,我们给出了某些循环图边传递的必要条件和充分条件。

英文摘要:

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all connected edge-transitive graphs on less than or equal to $20$ vertices. We then present a construction for an infinite family of edge-transitive bipartite graphs, and use this construction to show that there exists a non-trivial bipartite subgraph of $K_{m,n}$ that is connected and edge-transitive whenever $gcd(m,n)>2$. Additionally, we investigate necessary and sufficient conditions for edge transitivity of connected $(r,2)$ biregular subgraphs of $K_{m,n}$, as well as for uniqueness, and use these results to address the case of $gcd(m,n)=2$. We then present infinite families of edge-transitive graphs among vertex-transitive graphs, including several classes of circulant graphs. In particular, we present necessary conditions and sufficient conditions for edge-transitivity of certain circulant graphs.

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

↑