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

一类图的卷曲数

On the Curling Number of Certain Graphs

Johan Kok, Naduvath Sudev, Chithra Sudev

摘要:

本文引入了简单有限连通图的卷曲子列的概念。卷曲子序列是简单连通图$G$的度序列的极大子序列$C$,它的卷曲数$cn(G)$与度序列本身的卷曲数相对应,因此我们称它为图$G$的卷曲数.具有相等元素的最大度子序列称为恒等子序列。简单连通图$G$中单位卷曲度序列的个数记为$ic(G).$.本文证明了卷曲数猜想对简单连通图$G$在$n \geq 1$顶点上的度序列成立.我们还引入了简单连通图$G$的复合卷曲数的概念,并对某些标准图如Jaco图和集图的卷曲数进行了研究。

英文摘要:

In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence $C$ of the degree sequence of a simple connected graph $G$ for which the curling number $cn(G)$ corresponds to the curling number of the degree sequence per se and hence we call it the curling number of the graph $G$. A maximal degree subsequence with equal entries is called an identity subsequence. The number of identity curling subsequences in a simple connected graph $G$ is denoted $ic(G).$ We show that the curling number conjecture holds for the degree sequence of a simple connected graph $G$ on $n \geq 1$ vertices. We also introduce the notion of the compound curling number of a simple connected graph $G$ and then initiate a study on the curling number of certain standard graphs like Jaco graphs and set-graphs.

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

↑