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

点传递图的核

Cores of Vertex Transitive Graphs

David Roberson

摘要:

图X的一个核是一个顶点极小子图,X允许一个同态到它。Hahn和Tardif证明了对于顶点传递图,核心的大小必须除以图的大小。这激发了下面的问题:什么时候可以顶点传递图的顶点集被划分成集,每一个诱导其核心的副本?我们表明,正常的凯莱图和顶点传递图的核心一半的大小总是承认这样的分区。我们还表明,顶点传递图的顶点集的核心小于一半的大小不,在一般情况下,有这样的分区。

英文摘要:

A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question: when can the vertex set of a vertex transitive graph be partitioned into sets each of which induce a copy of its core? We show that normal Cayley graphs and vertex transitive graphs with cores half their size always admit such partitions. We also show that the vertex sets of vertex transitive graphs with cores less than half their size do not, in general, have such partitions.

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

↑