关于紧图和超紧图的几个结果

给出了一些 新的紧图,并对 不是超紧的紧图 作了一些讨论     

关于紧图的一些研究结果

双随机矩阵有许多重要的应用,紧图族可以看作是组合矩阵论中关于双随机矩阵的著名的Birkhoff定理的拓广,具有重要的研究价值.确定一个图是否紧图是个困难的问题,目前已知的紧图类尚且不多,介绍从某些已知的紧图出发不断构造紧图的加边法,可以构造无穷多个紧图族.     

完全超紧图

Chia G.L.和Lim C.K.在东南亚第一次图论会议(1983,新加坡)文集的末尾提出六个未解决问题.第五个问题是:设H是自补图,问是否存在自补完全超紧图G,使G~*=H.第六个问题是:设G是完全超紧图.如果G_0与(?)同构,问G是否自补图.本文肯定地回答了第五个问题和否定地回答了第六个问题.     

有关完全图的图的紧性

双随机矩阵有许多重要的应用,紧图族可以看作是组合矩阵论中关于双随机矩阵的著名的Birkhoff定理的拓广,具有重要的研究价值.确定一个图是否紧图是个困难的问题,目前已知的紧图族尚且不多,给出了三个结果:任意多个完全图的不交并是紧图;圈C_3与圈C_n(n3)的不交并是非紧图;当n是大于等于3的奇数时,完全图K_n与图K_(n+1)的不交并是非紧图,其中图K_(n+1)是从完全图K_(n+1)删去一因子而得到的图.     

非正规 Cayley 图的两个充分条件及其应用

群G的Cayley图Cay(G, S)称为是正规的, 如果G的右正则表示R(G)在Cay(G, S)的全自同构群中正规. 给出了非正规 Cayley图的两个充分条件. 应用该结果, 构造了5个连通非正规Cayley图的无限类, 并决定了A₅的所有连通5度非正规 Cayley图,从而推广了徐明曜和徐尚进关于A₅的连通3、4度Cayley图正规性结果. 此外, 决定了A₅的所有连通5度非CI Cayley图.     

超序列紧fts,可数超紧fts和超列紧fts

文献[1]中定义了序列紧fts(每个不分明集序列有收敛的子序列)和可数紧fts(每个可数开覆盖存在有限子覆盖)。对于序列紧fts,得到“每个fts都是序列紧的”病态结果,由此可见这样定义的序列紧fts不是一般拓扑学中序列紧的良扩张。对于可数紧fts,[2]在评论F-紧性时,论证了凡T_1空间都不是F-紧空间,以上的论证也可得到凡T_1空间都不是可数紧fts的病态结果。我们还要指出,[1]定义的可数紧fts也不是一般拓扑学中可数紧的良扩张。     

L-拓扑空间的单点超F紧化

给出L-拓扑空间的单点超F紧化的一种具体作法,以及局部超F紧性的定义,并证明了:(1)局部超F紧性是L-好推广;(2)一个L-拓扑空间是局部超F紧T2空间当且仅当其单点超F紧化空间是超F紧T2空间;(3)单点超F紧化在同胚意义下是唯一的。     

下方图度量下的非紧模糊数空间

证明了非紧模糊数空间E^～在下方图度量下关于模糊数的序是可逼近的。本文给出的证明方法是构造性的，从而说明了模糊数值积分如M-积分和G-积分等是可计算的。最后给出了E^～中关于下方图度量的一些分析性质。     

L-双拓扑空间中的配超紧性

借助相关远域族给出L-双拓扑空间中配超紧性的定义,研究它们的等价刻画和基本性质,证明配超紧性是弱拓扑不变性.     

模糊数关于紧承下方图度量的线性性质

证明了紧承下方图度量不是平移不变的.对紧承下方图度量的代数运算的连续性进行了讨论.证明了关于紧承下方图度量,模糊数空间只能是嵌入到拓扑向量空间当中,但不嵌入赋范线性空间当中.并与关于上确界度量的结果进行了比较.最后,给出了一个紧承下方图度量的下界.     

Super d-antimagic labelings of disconnected plane graphs

This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in such a way that the label of a face and the labels of the vertices and edges surrounding that face add up to a weight of that face, and the weights of all s-sided faces constitute an arithmetic progression of difference d, for each s that appears in the graph. The paper examines the existence of such labelings for disjoint union of plane graphs.     

A Local Property of Large Polyhedral Maps on Compact 2-Dimensional Manifolds

We prove that each polyhedral map G on a compact 2-manifold, which has large enough vertices, contains a k-path, a path on k vertices, such that each vertex of it has, in G, degree at most 6k; this bound being best possible for k even. Moreover, if G has large enough vertices of degree >6k, than it contains a k-path such that each its vertex has degree, in G, at most 5k; this bound is best possible for any k. Received: December 8, 1997 Revised: April 27, 1998     

The number of edges of radius-invariant graphs

The eccentricity e(υ) of vertex υ is defined as a distance to a farthest vertex from υ. The radius of a graph G is defined as r(G) = {e(u)}. We consider properties of unchanging the radius of a graph under two different situations: deleting an arbitrary edge and deleting an arbitrary vertex. This paper gives the upper bounds for the number of edges in such graphs. Supported by VEGA grant No. 1/0084/08.     

A Characterization of Distance-Regular Graphs with Diameter Three

We characterize the distance-regular graphs with diameter three by giving an expression for the number of vertices at distance two from each given vertex, in terms of the spectrum of the graph.     

The nonorientable genus of the join of two cycles

In this paper, we show that the nonorientable genus of Cm ＋ Cn, the join of two cycles Cm and Cn, is equal to [（（m-2）（n-2））/2] if m = 3, n ≡ 1 （mod 2）, or m ≥ 4, n ≥ 4, （m, n） （4, 4）. We determine that the nonorientable genus of C4 ＋C4 is 3, and that the nonorientable genus of C3 ＋Cn is n/2 if n ≡ 0 （mod 2）. Our results show that a minimum nonorientable genus embedding of the complete bipartite graph Km,n cannot be extended to an embedding of the join of two cycles without increasing the genus of the surface.     

Probabilistic methods in graph theory

One of the lessons Paul Erdös taught us is that probabilistic counting arguments often yield surprisingly strong existence results in combinatorics. This paper illustrates the paradigm on four examples drawn from Erdös's own work. The examples concern the chromatic number of a graph.Technical Report SOCS-8218, November 1982.