交叉立方体网络的反馈数

对于简单图G=(V,E),顶点子集F■V,如果由V\F导出的子图G′= (V\F,E′)是不含圈的,则称F是图G的一个反馈点集.点数最少的反馈点集称图的最小反馈点集,最小的点数称为反馈数.文章给出了交叉立方体网络的一个等价定义,用递归的方法构造出交叉立方体网络的诱导树,证明了诱导树的阶数Fibonacci数,进而得到叉立方体网络反馈数的上下界.     

Kautz网络中的最小反馈点集

对简单有向图D=(V，E)，顶点子集F∈V，如果由V＼F导出的子图不含有向圈，则称F是D的反馈点集。点数最小的子集F称为最小反馈点集。最小的点数称为反馈数。本利用Kautz最小轨道的方法确定出了Kautz有向图K(d，k)反馈数的一个下界和上界。并且具体给出了当k≤3时的反馈数。     

若干图的点强全着色

图G(V,E)的一正常k-全着色σ称为G(V,E)的一个k-点强全着色,当且仅当v∈V(G),N[v]中的元素着不同颜色,其中N[v]={u|vu∈E(G)}∪{v}.并且vχsT(G)=min{k|存在G的一个k-点强全着色}称为G(V,E)的点强全色数.本文得到了一些特殊图的点强全色数χvTs(G),并提出猜想:对于简单图G,有k(G)≤χvTs(G)≤k(G)+1,这里k(G)表示图G中所有顶点间距离不超过2的点集的最大顶点数.     

关于图因子的邻集条件

设F为图G的一个支撑子图.如果对所有x∈V(G),有d_F(x)∈{1,3,…,2n-1),则称F为G的一个(1,3,…,2n-1)一因子;如果对所有x∈V(G),有d_F(x)=k,则称F为G的一个k-因子.本文以图的顶点邻集对一个图具有包含任一条给定边的{1,3,…,2n-1)-因子和k-因子分别给出了充分条件.     

仙人掌图的邻点被扩展和可区别全染色

设G为简单图.G的全k-染色是指k种颜色1,2,…,k对图G的全体顶点及边的一个分配.设c是图G的一个全k-染色,任意的x∈V(G),称■为点x的扩展和,其中N(x)={y∈V(G)|xy∈E(G)}.称图G的全k-染色c为邻点被扩展和可区别(简记为NESD),如果w(x)≠w(y),其中xy∈E(G).使得图G存在NESD全k-染色的最小值k被称为图G的邻点被扩展和可区别全色数,简记为egndi_∑(G).本文利用数学归纳法探讨了仙人掌图的邻点被扩展和可区别全染色,并证明了这类图的邻点被扩展和可区别全色数不超过2.该结论说明Flandrin等人提出的NESDTC猜想对于仙人掌图是成立的.     

几类图的调和着色数的估计

引言设 V(G),E(G)分别表示无向单纯图 G 的顶点集和边集.称 V(G)到集{1,2,…,k}上的映射 f 为 G 的一个 k-着色.如果 u、v 是边 e 的两个端点,称 f(e)={f(u),f(v)}是 e 的色对.如果在 G 的一个着色中,相邻的点有不同的色,不同的边有不同的色对,则称此着色是调和的.使 G 能有 k-调和着色的最小整数 k 被称为 G 的调和着色数,记作 h(G).     

图的邻点全和可区别全染色

设f:V(G)∪E(G)→{1,2,…,k}是图G的一个正常k-全染色。令■其中N(x)={y∈V(G)|xy∈E(G)}。对任意的边uv∈E(C),若有Φ(u)≠Φ(v)成立,则称f是图G的一个邻点全和可区别k-全染色。图G的邻点全和可区别全染色中最小的颜色数k叫做G的邻点全和可区别全色数,记为f tndi∑(G)。本文确定了路、圈、星、轮、完全二部图、完全图以及树的邻点全和可区别全色数,同时猜想:简单图G(≠K2)的邻点全和可区别全色数不超过△(G)+2。     

不含3,4,8-圈的平面图的2-距离染色（英文）

图G的k-2-距离染色是指映射c:V(G)→{1,2,…,k},使得对G中满足0d_G(u,v)≤2的点对u,v,有c(u)≠c(v).称χ_2(G)=min{k|G有一个k-2-距离染色}为G的2-距离色数.本文证明了不含3,4,8-圈,且△≥14的平面图是(△+5)-2-距离可染的.     

退化图中的子图计数问题研究

令G表示n个顶点的图,如果G的每个子图中都包含一个度至多为k的顶点,则称G为k-退化图.令N(G,F)表示G中F子图的个数.主要研究了k-退化图中完全子图和完全二部子图的计数问题,给出了计数的上界以及相应的极图.首先,证明了Ν(G,K_t)≤(n-k)(k t-1)+(k t).其次,如果s,t≥1,n≥k+1且s+t≤k,我们证明了Ν(G,K_s,t)≤{(k s)(n-s s)-1/2(k s)(k-s s),t=s,(k s)(n-s t)+(k t)(n-t s)-(k t)(k-t s),t≠s.此外,还研究了在最大匹配和最小点覆盖为给定值的情况下,图G中的最大边数.记v(G),K(G)分别为图G的最大匹配数和最小点覆盖.证明了当v(G)≤k,K(G)=k+r且n≥2k+2r²+r+1时,有e(G)≤(k+r+1 2)+(k-r)(n-k-r-1).     

围长至少为5的平面图的injective-染色

图G的injective k-染色是指映射c:V(G)→{1,2,…,k},使有公共邻点的两个顶点u,v满足c(u)≠c(v),用X_i(G)表示使G有一个injective k-染色的最小正整数k.对g(G)≥5的平面图G,若△(G)≥20,证明了X_i(G)≤△+3.     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

Instructions for Authors

<正>Submission Authors must use LaTeX for typewriting,and visit our website www.actamath.com to submit your paper.Our address is Editorial Office of Acta Mathematica Sinica,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,P.R.China.     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

正August 10-14,2015Beijin,China The International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.