|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A NEW PROPERTY OF BINARY UNDIRECTED de BRUIJN GRAPHS显示文摘The authors obtain a new property of the n-dimensional binary undirected de Bruijn graph UB(n) for n ≥4, namely, there is a vertex x such that for any other vertex y there exist at least two internally disjoint paths of length at most n - 1 between x and y in UB(n). The result means that the (n - 1, 2)-dominating number of UB(n) is equal to one if n ≥4. | XUJUNMING LUCHANGHONG ZHANGKEMIN | 2000 | Chinese Annals of Mathematics,Series B2000，21，1： | 3 |
| 2 | (d,m)-DOMINATING NUMBERS OF HYPERCUBE显示文摘This paper shows that the (d,m)-dominating number of the m-dimensional hypercube Q m(m≥4) is 2 for any integer d.[FK(W1*1。*2]m2[FK(W1*1。*2]+2≤d≤m. | LuChanghong ZhangKemin | 2002 | Applied Mathematics(A Journal of Chinese Universities)2002，17，1： | 1 |
| 3 | Δ-matchingsandedge-facechromaticnumbers显示文摘 | WangWeifan ZhangKemin | 1999 | ActaMathApplSin1999，22，2： | 1 |
| 4 | THE RAMSEY NUMBERS R(T_n, W_6) FOR T_N WITHOUT CERTAIN DELETABLE SETS显示文摘Let Tn denote a tree of order n and Wm a wheel of order m+1. In this paper,we determine the Ramsey numbers R(Tn W6) for Tn without certain deletable sets. | CHENYaojun ZHANGYunqing ZHANGKemin | 2005 | Journal of Systems Science & Complexity2005，18，1： | 0 |
| 5 | ON TOURNAMENTS OF SMALL ORDERS AND THEIR APPLICATIONS显示文摘In this paper, we generate all nonisomorphic tournaments of order at most nine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regular tournaments of order 11. For each of these tournaments~ we have given its scorelist, connectivity, diameter, the minimal number of feedbacks, automorphisms and spectra.Moreover, we have verified the well-known Kelly's Conjecture for n = 2k + 1≤11. And we also determine the n-universal tournaments for n≤θ. However ,several related results are given and some related open problems are raised. | ZHOUGuofei ZHANGKemin | 2003 | Journal of Systems Science & Complexity2003，16，4： | 0 |
| 6 | IS γα≤δ FOR GRAPHS WHICH HAVE DIAMETER TWO?显示文摘A subset of S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by γα(G), is called the acyclic domination number of G. S. M. Hedetniemi et al. on 2000 introduced the concept of acyclic domination and posed the following open problem: Is γα(G) ≤ δ(G) for any graph whose diameter is two? In this paper, we give a counterexample which disproves the problem. | CHENYaojun ZHANGYunqing ZHANGKemin | 2003 | Journal of Systems Science & Complexity2003，16，2： | 0 |
| 7 | ON THE EXPONENT SET OF PRIMITIVELOCALLY SEMICOMPLETE DIGRAPHS显示文摘A locally semicomplete digraph is a digraph D=(V,A) satisfying the following condi-tion for every vertex x∈V the D[O(x)] and D[I(x)] are semicomplete digraphs. In this paper,we get some properties of cycles and determine the exponent set of primitive locally semicompleted digraphs. | ZHANGKEMIN BuYUEHUA | 1997 | Applied Mathematics(A Journal of Chinese Universities)1997，12，3： | 0 |
| 8 | THE TOTAL CHROMATIC NUMBER OF PSEUDO-OUTERPLANAR GRAPHS显示文摘A Planar graph g is called a ipseudo outerplanar graph if there is a subset v.∈V(G),[V.]=i,such that G-V. is an outerplanar graph in particular when G-V.is a forest ,g is called a i-pseudo-tree .in this paper.the following results are proved;(1)the conjecture on the total coloring is true for all 1-pseudo-outerplanar graphs;(2)X1(G)+1 fo any 1-pseudo outerplanar graph g with △(G)≥3,where x4(G)is the total chromatic number of a graph g. | WANGWEIFAN ZHANGKEMIN | 1997 | Applied Mathematics(A Journal of Chinese Universities)1997，12，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员