小m条件下的联结数与分数(k,m)-消去图
Binding number of fractional (k,m) -deleted graphs for small m
高炜1
作者信息
- 1. 苏州大学数学科学学院,江苏苏州215006;云南师范大学信息学院,云南昆明650092
- 折叠
摘要
设k,m为整数,其中k≥2,m≥0且k≥{2m-1,若k是奇数,2m-2,若k是偶数.本文证明:若图G满足n＞4k+1-4√k+1-2m,bind(G)＞(2k-1)(n-1)/k(n-2)-2m+2,则G是分数(k,m)-消去图.当k是偶数时,若图G满足n＞4k+l-4√k+2-2m,bind(G)＞(2k-1)(n-1)/k(n-2)-2m+3,则G是分数(k,m)-消去图.同时,本文所给结果在一定意思上是最好的.
Abstract
Let k,m be integers with k≥2,m≥0 and k≥{ 2m -1,if k is odd,2m-2,if k is even.We show that if G be a graph of order n such that n＞4k +1-4√k +1-2m and bind(G)＞(2k-1)(n-1)/k(n-2)-2m+2,then G is a fractional (k,m)-deleted graph.We also show that in the case where k is even,if G be a graph of order n such that n ＞ 4k + 1 - 4 √k+ 2 - 2m and bind (G) ＞(2k-1)(n-1)/k (n-2)-2m + 3,then G is a fractional (k,m)-deleted graph.Furthermore,we will show that the results in our paper are best possible in some sense.
关键词
图/分数因子/分数(k,m)-消去图/联结数Key words
graph/fractional factor/fractional ( k, m) -deleted graph/binding number引用本文复制引用
出版年
2012
NETL
NSTL
维普
万方数据