至多k个2连通块的图的最大边数
The maximum number of edges of a graph with at most k 2-connected blocks
刘艳芳1
作者信息
- 1. 闽南师范大学数学与统计学院,福建 漳州 363000
- 折叠
摘要
对k=[√1.02n]和k=[√n],分别给出至多k个2连通块的n阶无等长圈图的最大边数g2(n,k) 的一个下界(g2(n,[√1.02n])≥n+√(2+899/2363)n(1-o(1)),g2(n,[√n])≥n+√(2+484/1279)n(1-o(1))),其中n为充分大的正整数.
Abstract
Fork=[√1.02n]and k=[√n],this paper gives a lower bound of the maximum possible number of edges g2(n,k)for a graph of order n without isometric cycles with at most k 2-connected blocks:(g2(n,[√1.02n])≥n+√(2+899/2363)n(1-o(1)),g2(n,[√n])≥n+√(2+484/1279)n(1-o(1))),where n is a sufficiently large positive integer.
关键词
圈长/边数/2连通块Key words
cycle length/edge number/2-connected block引用本文复制引用
出版年
2024
NETL
NSTL
万方数据