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

分割图形和块表达

Split graphs and Block Representations

Karen L. Collins, Ann N. Trenk, Rebecca Whitman

摘要:

本文从图的顶点度序列和控制下的关联格的角度研究了分裂图及相关的图类。在2003年Merris工作的基础上,我们定义了块$[α(π)|β(π)]$,其中$π$是图的度序列,$α(π)$和$β(π)$是由$π$产生的序列.我们使用块表示$[α(π)|β(π)]$来表征以下类别中的成员:不平衡分裂图,平衡分裂图,伪分裂图和三种Nordhaus-Gaddum图(由Collins和Trenk在2013年定义)。在梅里斯的工作中,我们形成一个偏序集下的关系优,其中的元素是块$[α(π)|β(π)]$表示分裂图与固定数量的边缘。我们分区这个偏序集在几个有趣的方式使用我们所谓的双耳瓶,并证明了向上和向下封闭的结果所产生的块从不同的家庭的图。最后,我们证明了偏序集在最大和最小元素的作用下成为格,并证明了两个块的交和并的性质。

英文摘要:

In this paper, we study split graphs and related classes of graphs from the perspective of their sequence of vertex degrees and an associated lattice under majorization. Following the work of Merris in 2003, we define blocks $[α(π)|β(π)]$, where $π$ is the degree sequence of a graph, and $α(π)$ and $β(π)$ are sequences arising from $π$. We use the block representation $[α(π)|β(π)]$ to characterize membership in each of the following classes: unbalanced split graphs, balanced split graphs, pseudo-split graphs, and three kinds of Nordhaus-Gaddum graphs (defined by Collins and Trenk in 2013). As in Merris' work, we form a poset under the relation majorization in which the elements are the blocks $[α(π)|β(π)]$ representing split graphs with a fixed number of edges. We partition this poset in several interesting ways using what we call amphoras, and prove upward and downward closure results for blocks arising from different families of graphs. Finally, we show that the poset becomes a lattice when a maximum and minimum element are added, and we prove properties of the meet and join of two blocks.

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

↑