关于控制临界数(英)

本文给出控制临界数的一系列上界，且刻划了控制临界数为△＋1的图的特征．     

关于竞赛图的完备强路连通性的一个充要条件

在本文定理2中!证明了如下结果:p个顶点的竞赛图T=(V,A)是完备强路连通的充要条件是对T中任一弧,在T中总存在对应这弧的P_2、P′_2、P′_(p-1)、P′(p-1). 本文提出如下猜测:p个顶点的竞赛图T=(V,A)中的任一弧,在T中总存在对应这弧的 P′_2、P′_(p-1),则T具有强路连通性.     

直径为d的超环面网的(d,2n)-控制数

n维超环面网C(dl,d2,…,dn)定义如下顶点集为{(x1,..,xn)|0≤xi<di(1≤i≤n)};每个顶点(xl,…,xn)与(x1±1,x2,…,xn),(xl,x2±1,…,xn),…,(x1,x2,….,xn±1)这2n个顶点相邻.(d,m)-控制数是用来刻画互连网络数据传输某种模式的一个新参数.本文证明了当d=diam(C(d1,d2,…,dn))时,n维超环面网C(d1,d2,…,dn)≠C(3,3,….,3)的(d,2n)控制数为2(n≥3,di≥3,i∈{1,2,…,n}.     

恰含d个非零对角元的本原矩阵的广义最大密度指数集

设Ａ是一个具有周期ｐ的ｎ×ｎ不可约布尔矩阵,文［１］定义了矩阵的广义最大密度指数ｈＡ（ｋ）令ＤＩＳｎ,ｄ（ｋ）＝｛ｈＡ（ｋ）｜ Ａ ＰＭｎ（ｄ）｝,其中ＰＭｎ（ｄ）是所有恰含ｄ个非零对角元的ｎ×ｎ本原矩阵的集合．本文证明了另外,我们定义矩阵Ａ的范数,用Ａ表示,为Ａ中１的个数,并且刻划了具有最小范数的极矩阵．     

某些图论问题的进展

本文介绍了图论中某些问题的进展情况,其中问题1-50是Bondy和Murty著的"图论及其应用"一书附录Ⅳ中的问题,问题51-90是从其它方面收集来的新问题.     

关于星和条的Ramsey数

令和．该文研究了广义Ramsey数n(K1,n1,…,K1,nt, m1K2,…,msK2)．当1≤■≤∑时,得到了它们的精确值;当∑>■时,得到了它们的上 界．     

THE RAMSEY NUMBERS FOR STARS AND STRIPES

Let Σ=Σ_{i=1}^{t}(n_i-1) and Λ=Σ_{j=1}^s(m_j-1). This paper considers the generalized Ramsey number R(K_{1,n_1},…, K_{1,n_t},m_1K_2,…, m_sK_2) for any Σ and Λ. And the authors get their exact values if 1<=Λ<=Σ and their upper bounds if Λ>= Σ     

竞赛图具有弧泛回路性的一个充要条件

本文的主要结果为:p个顶点的竞赛图T,具有弧泛回路性的充分必要条件是T具有弧3-回路与弧p-回路性。     

Outpaths of arcs in multipartite tournaments

1. IntroductionThroughout the paPer, we use the terminology and notation of [1] and [2]. Let D =(V(D), A(D)) be a digraPh. If xy is an arc of a digraPh D, then we say that x dominatesy, denoted by x - y. More generally, if A and B are two disjoint vertex sets of D such thatevery vertex of A dominates every vertex of B, then we say that A dominates B, denotedby A - B. The outset N (x) of a vertex x is the set of vertices dominated by x in D,and the inset N--(x) is the set of vertices d…     

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

1 IntroductionLet G be a plane graph with the vertex set V(G), the edge set E(G), the faCe set F(G),and the maximum degree A(G). The edge-face chromatic number X.I (G) of G is the ndnimumnunther of colors assigned to E(G) U F(G) such that aliy two adjacent or incident elements havedifferent colors. By the definition, X.,(G) 2 A(G) is trivial. In 1975, MelnikovI4J raised thefollowing conjecture.,Coniecture 1.1 For every plane graph G, X.J (G) 5 A(G) 3.The conjecture has been ton…