【摘要】 设σ(Tm,k,n)是最小正偶数,使得所有满足σ(π)=d1+d2+…+dn≥σ(Tm,k,n)的n项可图序列π是蕴含Tm,k可图的,即π=(d1,d2,…,dn)有一个实现含一直径为k的m阶树.考虑了σ(Tm,k,n)之值问题,并确定了当k=3且n充分大时σ(Tm,3,n)的值.更多还原

【Abstract】 Let σ(Tm,k,n) be the smallest even integer such that every n-term graphic sequence π=(d1,d2,…,dn) with σ(π)=d1+d2+…+dn≥σ(Tm,k,n) be potentially Tm,k-graphic,i.e.,π has a realization G containing a tree of diameter k on m vertices as a subgraph.Considering σ(Tm,k,n),its value is obtained,where k=3 and sufficiently large n.更多还原