广义U—统计量的指数收敛速度

文「１」研究了一样本Ｕ－统计量的指数收敛速度，本文则研究了广义Ｕ－统计量的指数收敛速度。     

U-统计量的指数收敛速度的进一步讨论

在独立未必同分布的情形下，对U－统计量的指数收敛速度进行了讨论，减弱文[2]中的部分条件，给出了类似的结果，同时对Von-Mises统计量也给出了指数收敛速度。     

关于Γ-收敛的极限泛函表达式的注记

结合概周期函数的性质和Γ－收敛技巧，本文对很广泛的一类泛函的Γ－极限给出了统一的表达式，且此表达式比现在已有的结果更明确．     

关于λ-数乘收敛级数的不变性

本文证得（1）若λ具有弱滑脊性，那么λ-数乘收敛级数具有对偶不变性。（2）若λ包含C00，那么λ-数乘收敛级数具有全程不变性的充要条件为（λ，β（λ，λβ））是AK－空间。     

关于ρ-混合序列对数律的收敛速度

本文研究了ρ-混合序列对数律的收敛速度，在较弱的矩条件下得到了与独立同分布实随机变量类似的结果，并获得了ρ－混合序列满意对数律的一个充分性结果；讨论了ρ－混合序列重对数律的收敛速度的问题，得到了一个重对数律的充分性条件。     

关于收敛的P—级数和的近似值

当p>1时,p-级数sum from n≥1n 1/p是收敛的.若取p=2,是著名的Bernoulli级数.早在17世纪,由Euler用代数方程与三角函数方程进行类比的方法,给出了     

图的最大亏格与2-因子

图Ｇ的一个２因子Ｆ就是Ｇ的这样一个支撑子图，使其任何节点ｖ∈Ｖ的次ｄＦ（ｖ）＝２．易见，Ｇ的每个２因子均为无公共节点的圈之并．若Ｆ的每个圈的长均为３（或４），则称Ｇ含有一个三角形（或四边形）２因子．Ｍ．ｋ∨ｏｖｉｅｒａ［５］得到了含有三角形２因子的３－正则图的最大亏格．本文在３－正则图上，引进了扩张运算和讨论了与最大亏格和Ｂｅｔｉ亏数之间的关系．利用这些运算，得到了所有含四边形２因子的连通３－正则图是上可嵌入的，即γＭ（Ｇ）＝ｎ４（ｎ为Ｇ的节点数ｎ＝｜Ｖ（Ｇ）｜）．然后，基于此证明了含四边形２因子且所有节点ｖ∈Ｖ的次ｄＧ（ｖ）＝３（ｍｏｄ４）的图Ｇ均为上可嵌入的     

k-U统计量的指数收敛速度

研究了k-U统计量的收敛速度,在一组适当的正则条件下,获得了k-U统计量的指数收敛速度,推广了U-统计量的指数收敛速度的相应结果.     

关于指数丢番图方程的Hugh Edgar问题

§1 Hall在组合数学的T型差集讨论中,提出了求解Diophantus方程p~m-q~n=2,m>1,n>1(p,g是素数) (1)的问题.后来,Hugh Edgar提出了更为一般的问题,即对给定的素数p,q和整数h,求方程     

Clique‐inverse graphs of K3‐free and K4‐free graphs

The clique graph K(G) of a given graph G is the intersection graph of the collection of maximal cliques of G. Given a family ℱ of graphs, the clique‐inverse graphs of ℱ are the graphs whose clique graphs belong to ℱ. In this work, we describe characterizations for clique‐inverse graphs of K₃‐free and K₄‐free graphs. The characterizations are formulated in terms of forbidden induced subgraphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 257–272, 2000     

Strong cliques in vertex-transitive graphs

A clique (resp, independent set) in a graph is strong if it intersects every maximal independent set (resp, every maximal clique). A graph is clique intersect stable set (CIS) if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques. In this paper we prove that a clique $C$ in a vertex-transitive graph $\mathrm{\Gamma }$ is strong if and only if $\text{◂=▸}\text{◂⋅▸}\mid C\mid \mid I\mid =\mid V\left(\mathrm{\Gamma }\right)\mid$ for every maximal independent set $I$ of $\mathrm{\Gamma }$. On the basis of this result we prove that a vertex-transitive graph is CIS if and only if it admits a strong clique and a strong independent set. We classify all vertex-transitive graphs of valency at most 4 admitting a strong clique, and give a partial characterization of 5-valent vertex-transitive graphs admitting a strong clique. Our results imply that every vertex-transitive graph of valency at most 5 that admits a strong clique is localizable. We answer an open question by providing an example of a vertex-transitive CIS graph which is not localizable.     

Strong chromatic index of unit distance graphs

The strong chromatic index of a graph , denoted by , is defined as the least number of colors in a coloring of edges of , such that each color class is an induced matching (or: if edges and have the same color, then both vertices of are not adjacent to any vertex of ). A graph is a unit distance graph in if vertices of can be uniquely identified with points in , so that is an edge of if and only if the Euclidean distance between the points identified with and is 1. We would like to find the largest possible value of , where is a unit distance graph (in and ) of maximum degree . We show that , where is a unit distance graph in of maximum degree . We also show that the maximum possible size of a strong clique in unit distance graph in is linear in and give a tighter result for unit distance graphs in the plane.     

Iterated clique graphs with increasing diameters

A simple argument by Hedman shows that the diameter of a clique graph G differs by at most one from that of K(G), its clique graph. Hedman described examples of a graph G such that diam(K(G)) = diam(G) + 1 and asked in general about the existence of graphs such that diam(Kⁱ(G)) = diam(G) + i. Examples satisfying this equality for i = 2 have been described by Peyrat, Rall, and Slater and independently by Balakrishnan and Paulraja. The authors of the former work also solved the case i = 3 and i = 4 and conjectured that such graphs exist for every positive integer i. The cases i ≥ 5 remained open. In the present article, we prove their conjecture. For each positive integer i, we describe a family of graphs G such that diam(Kⁱ(G)) = diam(G) + i. © 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 147–154, 1998     

On λ-harmonic graphs

A λ harmonic graph G, a λ-Hgraph G for short, means that there exists a constant denotes the degree of vertex vi. In this paper, some harmonic properties of the complement and line graph are given, and some algebraic properties for the λ-Hgraphs are obtained.     

On the second largest eigenvalue of line graphs

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined. © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 61–66, 1998     

On subpancyclic line graphs

We give a best possible Dirac-like condition for a graph G so that its line graph L(G) is subpancyclic, i.e., L(G) contains a cycle of length l for each l between 3 and the circumference of G. The result verifies the conjecture posed by Xiong (Pancyclic results in hamiltonian line graphs, in: Combinatorics and Graph Theory '95, vol. 2, Proceedings of the Summer School and International Conference on Combinatorics, World Scientific). © 1998 John Wiley & Sons, Inc. J Graph Theory 27: 67–74, 1998