共查询到20条相似文献,搜索用时 62 毫秒
1.
§1. IntroductionTofindthegeneraltermformulaofcalculatingwasanoldestprobleminNumberTheory.Earlyin300B.C.,Archimedo,themathematicianofancientGreece,workedouttheformula∑nk=1k=n(n+1)2and∑nk=1k2=n(n+1)(2n+1)6.Sofar,peoplehavegotmanyformsofepressionofthege… 相似文献
2.
一类K_n-E(G)型图的色唯一性 总被引:2,自引:0,他引:2
设Km-E(G)表示从完全图Km中删去一个和G同构的子图的所有边而得到的图.本文证明了,当G=k1Ps1∪k2PS2∪…∪krPsr,(si>1,si≠4,i=1,2,…,r),且Psi都是不可约路时,图Km-E(G)是色唯一的. 相似文献
3.
自然数方幂和的一个性质的证明 总被引:1,自引:0,他引:1
自然数方幂和的一个性质的证明湖南浏阳十一中刘会成令Sk(n)=1k+2k+…+nk(k≥0,k∈Z).文[1],[2],[3]均提到下面一个性质:S2k(N)=S2(n)P2(n)(i)S2k+1(n)=S21(n)P1(n)(ii)其中k为自然数,... 相似文献
4.
设n1≤n2≤…≤nk是正整数,D=C↑→n1×C↑→n2×…×C↑→nk是有向圈的直积。在本文中,我们证明了如果ni│nk(1≤i≤k-1),则D含有哈密根图。当n1=n2=…=nk时,我们进一步得到D含有[k/2」个弧不交的哈密顿圈。作为副产品,我们推出当Γ是哈密顿有向图时Γ×Γ也是哈密顿有向图。 相似文献
5.
6.
张秉儒 《纯粹数学与应用数学》1997,(1)
记δn=k≤nkn-k,在本文中证明了:r∈N,若i∈{1,2,…,r},qi(>5)都是素数,并且[(δqi-1-1)!+1]/δqi-1是正整数,则图簇Kn-Ek0P3∪k1Pq1-1∪k2Pq2-1∪…∪krPqr-1是色唯一的,推广了文[1]的结果 相似文献
7.
余道洒 《高校应用数学学报(A辑)》1997,(4)
{X,Xi,i≥1}是i.i.d.r.v′.s.在矩母函数存在的条件下,由古典的Erdos-Rényi大数律有limn→∞max0≤k≤n∑k+[clogn]i=k+1Xi[clogn]=α(c),α(c)为某常数.自正则下MiklósCsorgo&ShaoQiman(1994)在仅要求一阶矩的条件下就得到了:limn→∞max0≤k≤n∑k+[clogn]i=k+1Xi∑k+[clogn]i=k+1(X2i+1)=β(c),β(c)为某常数.众所周知,自正则下人们往往在较弱条件下取得相应结果是因为:分母中的X能有效抵销分子中X较大而引起整个分式极限行为的波动.因此,在什么样的条件下,式max0≤k≤n∑k+[clogn]i=k+1Xi∑k+[clogn]i=k+1X2i1-β[clogn]β→r(c)成为非常有意思的问题,因为它将依赖于β的大小.本文给出,当0<β≤12时,只要E(X)≥0,上式就有有限极限.当12<β<1时,则必须在矩母函数存在下,上式才有有限极限.并都求出了其极限表达式. 相似文献
8.
一维齐次Cantron集的Hausdorff维数 总被引:1,自引:0,他引:1
设{nk,k1}为一正整数序列,{ck,k1}为一正实数序列,满足nk2,0<ck<1,nkck1.设E为由{nk,k1},{ck,k1}定义的齐次Cantor集.本文证明集E的Hausdorf维数为dimHE=limk→∞logn1n2…nk-logc1c2…ck 相似文献
9.
本文讨论了如下一类线性errors-in-variables模型——多元线性结构关系模型β′xk+α=0,ξk=xk+εk.{k=1,2,…,n.其中,{xk:k=1,2,…,n}为一组i.i.d.的m维随机向量,{εk:k=1,2,…,n}是i.i.d.的随机误差,E(ε1)=0,Var(ε1)=σ2Im.且{xk:k=1,2,…,n}与{εk:k=1,2,…,n}相互独立.在一些条件下,我们证明了估计量β,α,σ2的强相合性、唯一性,并给出了估计量的收敛速度为o(n-1-1q),这里q∈[1,2).对于E(x1)u1和Var(x1)Vx的估计也得出了同样的结果 相似文献
10.
祁永成 《数学年刊A辑(中文版)》1994,(3)
投{Xn,n≥1}i.i.d.,Xn,1≤Xn,2≤…≤Xn,n是X1,X2,…,Xn的次序统计量.对非负整数k,r,k+r≤n,令.本文研究当k=kn,r=rn满足min(k,r)→∞,max(k,r)→0时截断和Sn(k,r)的弱大数律.设βn>0,Cn∈R,文中给出了依概率收敛的充要条件. 相似文献
11.
用k4(a ,b ,c ,d ,e,f)表示k4 同胚图 ,其中a ,b ,c ,d ,e,f分别表示度为 3的顶点间的道路的长 .本文主要研究了两类k4 同胚图的色唯一性 ,同时得到了几族新的不是色唯一的k4 同胚图 相似文献
12.
Some necessary conditions on a graph which has the same chromatic polynomial as the complete tripartite graph Km,n,r are developed. Using these, we obtain the chromatic equivalence classes for Km,n,n (where 1≤m≤n) and Km1,m2,m3 (where |mi−mj|≤3). In particular, it is shown that (i) Km,n,n (where 2≤m≤n) and (ii) Km1,m2,m3 (where |mi−mj|≤3, 2≤mi,i=1,2,3) are uniquely determined by their chromatic polynomials. The result (i), proved earlier by Liu et al. [R.Y. Liu, H.X. Zhao, C.Y. Ye, A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs, Discrete Math. 289 (2004) 175-179], answers a conjecture (raised in [G.L. Chia, B.H. Goh, K.M. Koh, The chromaticity of some families of complete tripartite graphs (In Honour of Prof. Roberto W. Frucht), Sci. Ser. A (1988) 27-37 (special issue)]) in the affirmative, while result (ii) extends a result of Zou [H.W. Zou, On the chromatic uniqueness of complete tripartite graphs Kn1,n2,n3 J. Systems Sci. Math. Sci. 20 (2000) 181-186]. 相似文献
13.
Let P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H,λ)=P(G,λ) implies H is isomorphic to G. For integers k≥0, t≥2, denote by K((t−1)×p,p+k) the complete t-partite graph that has t−1 partite sets of size p and one partite set of size p+k. Let K(s,t,p,k) be the set of graphs obtained from K((t−1)×p,p+k) by adding a set S of s edges to the partite set of size p+k such that 〈S〉 is bipartite. If s=1, denote the only graph in K(s,t,p,k) by K+((t−1)×p,p+k). In this paper, we shall prove that for k=0,1 and p+k≥s+2, each graph G∈K(s,t,p,k) is chromatically unique if and only if 〈S〉 is a chromatically unique graph that has no cut-vertex. As a direct consequence, the graph K+((t−1)×p,p+k) is chromatically unique for k=0,1 and p+k≥3. 相似文献
14.
15.
Aysel Erey 《Discrete Mathematics》2018,341(5):1419-1431
16.
关于K4同胚图色唯一性的几个新结果 总被引:4,自引:0,他引:4
本文证得:如果i,j,k,l,m,n中有四个数相等,而另外二个数不小于此数,则K_4(i,j,k,l,m,n)是色唯一的.此外,我们还得到了另外两族具有色唯一性的K_4同胚图. 相似文献
17.
A circulant C(n;S) with connection set S={a1,a2,…,am} is the graph with vertex set Zn, the cyclic group of order n, and edge set E={{i,j}:|i−j|∈S}. The chromatic number of connected circulants of degree at most four has been previously determined completely by Heuberger [C. Heuberger, On planarity and colorability of circulant graphs, Discrete Math. 268 (2003) 153-169]. In this paper, we determine completely the chromatic number of connected circulants C(n;a,b,n/2) of degree 5. The methods used are essentially extensions of Heuberger’s method but the formulae developed are much more complex. 相似文献
18.
Let G be any graph, and also let Δ(G), χ(G) and α(G) denote the maximum degree, the chromatic number and the independence number of G, respectively. A chromatic coloring of G is a proper coloring of G using χ(G) colors. A color class in a proper coloring of G is maximum if it has size α(G). In this paper, we prove that if a graph G (not necessarily connected) satisfies χ(G)≥Δ(G), then there exists a chromatic coloring of G in which some color class is maximum. This cannot be guaranteed if χ(G)<Δ(G). We shall also give some other extensions. 相似文献
19.
If we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with respect to G and we show that it coincides with the chromatic number of a double covering of G with co-support H. We also find a few estimations for the chromatic numbers of H with respect to G. 相似文献
20.
Let Gn,p denote the random graph on n labeled vertices, where each edge is included with probability p independent of the others. We show that for all constant p