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

关于几乎自中心图和几乎周边图

On almost self-centered graphs and almost peripheral graphs

Yanan Hu, Xingzhi Zhan

摘要:

几乎自中心图是具有恰好$n-2$中心点的$n$阶连通图,几乎周边图是具有恰好$n-1$周边点的$n$阶连通图。我们确定了(1)$n;$阶几乎自中心图的最大围长;(2)$n$阶几乎自中心图的最大独立数和半径$r;$;(3)$k$正则几乎自中心图的最小阶数;(4)$n;$阶几乎周边图的最大尺寸。这些数目对于$n;$阶的几乎周边图的最大度是可能的(6)在其最大度是第二大可能的$n$阶的几乎周边图中的最大度的顶点的最大数目。只要极图有一个整齐的形式,我们也描述他们。

英文摘要:

An almost self-centered graph is a connected graph of order $n$ with exactly $n-2$ central vertices, and an almost peripheral graph is a connected graph of order $n$ with exactly $n-1$ peripheral vertices. We determine (1) the maximum girth of an almost self-centered graph of order $n;$ (2) the maximum independence number of an almost self-centered graph of order $n$ and radius $r;$ (3) the minimum order of a $k$-regular almost self-centered graph and (4) the maximum size of an almost peripheral graph of order $n;$ (5) which numbers are possible for the maximum degree of an almost peripheral graph of order $n;$ (6) the maximum number of vertices of maximum degree in an almost peripheral graph of order $n$ whose maximum degree is the second largest possible. Whenever the extremal graphs have a neat form, we also describe them.

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

↑