严格(d)-连通无圈超图的计数

研究了一般的标号严格(d)-连通无圈超图的计数,得到了n阶标号严格(d)-连通无圈超图的计数公式.     

无标号真严格(d)-连通无圈超图的计数

本文得到了无标号真严格(d)-连通无圈超图的计数公式,并得到了无标号真严格(d)-连通同胚k不可约无圈超图的计数公式.     

基于排列矩阵的一类析取矩阵

定义了k阶排列矩阵和(r+d)阶r-排列矩阵的概念,利用k阶排列矩阵和r-排列矩阵研究了d—析取矩阵、(d,e)-析取矩阵、(d,r,z]-析取矩阵的构造及其行数的行界.     

关于匀称超树数的猜想

1982年,毛经中对(k 1) p阶和q边的匀称超树的个数T_(k 1)(p,q)提出如下猜想:其余 易见,当k(?)1时,T(p, q) (q-1)~(?) p~p(?),故(*)成立将是标号树计数的Cayley公式在超图理论中的推广。 本书证明了上述猜想并得到一般超图的计数式。 定义 如果超图H (X,ε)是连通的且不含圈,则称H为一超树,若(?)E_i∈ε,|E_i|=M,则称H是匀称M秩超树。     

两类图的(d,1)-全标号

主要讨论了W_n与C_m的笛卡尔积和均衡完全r-部图K_r(n)的(d,1)-全标号,并得出了(d,1)-全数λ_d~T(W_n□C_m)和λ_d~T(K_(r(n)))的确切值.     

关于有向图与超图的计数

1980年,M.Hegde和M.R.Sridharan沿用R.C.Read的计数方法,得到了标号偶有向图和偶超图的计数公式。我们推广了[1]的结果,得到了恰有2k个奇度点的p阶有向图和(p,q)有向图,恰有k个奇度点的p阶超图和(p,q)超图的计数式。本文所讨论的图均指标号图。     

严格非匀称线性超树的计数公式

本文应用容斥原理，得到了有n个顶点、m条边的严格非匀称标号线性无圈超图的计数公式。     

弦图的L(3,2,1)}-标号

图 G 的一个 L(3,2,1)- 标号是指从 V(G) 到非负整数集的一个映射 f, 满足: 当 d_G(u,v)=1 时, |f(u)-f(v)|\geq 3; 当 d_G(u,v)=2 时, |f(u)-f(v)|\geq 2; 当 d_G(u,v)=1 时, |f(u)-f(v)|\geq 1. L(3,2,1)-标号问题就是确定出最小的整数 \lambda_3(G) 使得 G存在最大标号不超过该数的 L(3,2,1)- 标号. 本文研究了弦图的 L(3,2,1)- 标号问题,获得了弦图及其一些子类, 如扇, r- 路,r- 树等的 \lambda_3 数的界.     

r－不可分矩阵的本原指数（Ⅱ）

本文给出了 n阶 r-不可分矩阵的本原指数的上界 ,即任 n阶 r—不可分矩阵 A的本原指数 (A)≤n+(r- ) 2r (1≤ r相似文献   

图Cn及其r-冠的新的优美标号

研究了关于图的r-冠的优美标号的一个问题,证明了：当n≡0,3（mod 4）时,图Cn及其r-冠是优美图,所给出的新的优美标号不同于现有文献中得到的结果.进而证明了当n≡0（mod 4）时,图Cn及其r-冠也是交错图.     

Counting acyclic hypergraphs

Acyclic hypergraphs are analogues of forests in graphs. They are very useful in the design of databases. The number of distinct acyclic uniform hypergraphs withn labeled vertices is studied. With the aid of the principle of inclusion-exclusion, two formulas are presented. One is the explicitformula for strict (d)-connected acyclic hypergraphs, the other is the recurrence formula for linear acyclic hypergraphs.     

Counting acyclic hypergraphs

Acyclic hypergraphs are analogues of forests in graphs. They are very useful in the design of databases. The number of distinct acyclic uniform hypergraphs withn labeled vertices is studied. With the aid of the principle of inclusion-exclusion, two formulas are presented. One is the explicitformula for strict (d)-connected acyclic hypergraphs, the other is the recurrence formula for linear acyclic hypergraphs.     

Enumeration of labeled outerplanar bicyclic and tricyclic graphs

The class of outerplanar graphs is used for testing the average complexity of algorithms on graphs. A random labeled outerplanar graph can be generated by a polynomial algorithm based on the results of an enumeration of such graphs. By a bicyclic (tricyclic) graph we mean a connected graph with cyclomatic number 2 (respectively, 3). We find explicit formulas for the number of labeled connected outerplanar bicyclic and tricyclic graphs with n vertices and also obtain asymptotics for the number of these graphs for large n. Moreover, we obtain explicit formulas for the number of labeled outerplanar bicyclic and tricyclic n-vertex blocks and deduce the corresponding asymptotics for large n.     

具有割点的标号Euler图的计数

本文讲座了具有k(k≥2）个割点,并且所有割点均分布在一个2－连能Euler图的标号Euler图的计数,在这里给出了有含有n个2－连能Euler图和k(k≥2）个割点,并且所有割点均分布在其中一2－连能Euler图的标号Euler图的指数型生成函数。     

三路树P(m,n,t)是边幻图的证明(II)

令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图.     

Bier Spheres and Posets

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n – 2)-spheres on 2n vertices, as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his construction as giving the poset of all the intervals in a boolean algebra that “cut across an ideal.” Thus we arrive at a substantial generalization of Bier’s construction: the Bier posets Bier(P, I) of an arbitrary bounded poset P of finite length. In the case of face posets of PL spheres this yields cellular “generalized Bier spheres.” In the case of Eulerian or Cohen–Macaulay posets P we show that the Bier posets Bier(P, I) inherit these properties. In the boolean case originally considered by Bier, we show that all the spheres produced by his construction are shellable, which yields “many shellable spheres,” most of which lack convex realization. Finally, we present simple explicit formulas for the g-vectors of these simplicial spheres and verify that they satisfy a strong form of the g-conjecture for spheres.     

Enumeration of Lozenge Tilings of Hexagons with Cut-Off Corners

Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with “maximal staircases” removed from some of its vertices. The case of one vertex corresponds to Proctor's problem. For two vertices there are several cases to consider, and most of them lead to nice enumeration formulas. For three or more vertices there do not seem to exist nice product formulas in general, but in one special situation a lot of factorization occurs, and we pose the problem of finding a formula for the number of tilings in this case.     

ON k-DIAMETER OF k-CONNECTED GRAPHS

Abstract. Let G be a k-connected simple graph with order n. The k-diameter, combining con-nectivity with diameter, of G is the minimum integer     

Hamilton图的一个新的充分条件

设G是一个n阶3-连通1-坚韧图,以4(G)表示G的四元独立点集的次和的最小值,(G)为G的连通度,证明若