On the Range of Possible Integrities of Graphs G(n, k)
On the Range of Possible Integrities of Graphs G(n, k)
复制标题
关于图 G(n, k) 的可能完整性范围
DOI：
10.1007/s00373-010-0990-1
复制
发表时间：
2011
影响因子：
0.7
通讯作者：
C. Ernst
中科院分区：
文献类型：
--
作者：
M. Atici;C. Ernst
We discuss the range of values for the integrity of a graphsG(n,k) whereG(n,k) denotes a simple graph withnvertices andkedges. LetImax(n,k) andImin(n,k) be the maximal and minimal value for the integrity of all possibleG(n,k) graphs and let the difference beD(n,k) =Imax(n,k) −Imin(n,k). In this paper we give some exact values and several lower bounds ofD(n,k) for various values ofnandk. For some special values ofnand fors<n1/4we construct examples of graphsGn=Gn(n,n+s) with a maximal integrity ofI(Gn) =I(Cn) +swhereCnis the cycle withnvertices. We show that fork=n2/6 the value ofD(n,n2/6) is at leastfor largen.
