上连通和超连通三次点传递图

图G称为上连通的,若对每个最小割集C,G-C有孤立点,G称为超连通的,若对每个最小割集C,G-C恰有两个连通分支,且其中之一为弧立点,本文刻划了上连通和超连通三次点传递图。     

(d,r,k)-析取矩阵的卡氏积

(d,r,κ)-析取矩阵是分组测试理论中的一个Inhibitor模型.利用两个已知的(d,r,k)-析取矩阵定义了它们的卡氏积,并计算了这个新(d,r,κ)-析取矩阵的参数.     

关于Riemann可积的一个注记

鉴于R iem ann积分对区间的分割和取点的双重任意性要求给应用带来的困难,本文中我们将选择“等距分割”这种特殊的分割方式来定义函数的可积性,即所谓“等分可积”.从表面上看,等分可积性要弱于R iem ann可积性,但本文将证明这两种可积性是等价的.文中还给出了等分可积准则.     

关于一类广义Riccati方程三个可积判据的注记

通过变量变换的方法,将文[1]中一类广义Riccati方程的三个充分性判据统一起来,并加以推广.充分利用参数λ,κ的可变性揭示该结果与现有Riccati方程可积性间的关系,扩大了Riccati方程的可积性范围.     

直觉模糊有限状态机的积

利用代数方法给出直觉模糊有限状态机的直觉笛卡尔积、直觉直积、直觉限制直积、直觉圈积、直觉级联积构造方法,并且讨论了它们的代数性质,同时探讨了直觉模糊有限状态机的直觉限制直积的覆盖,级联积的可分离的,以及利用直觉模糊变换半群探索了直觉圈积的结合性.     

几类积图的团染色数

设G=（VE）为简单图,V和E分别表示图的点集和边集．图G的一个k-团染色是指点集V到色集{1,2,…,k）的一个映射,使得G的每个至少含两个点的极大团都至少有两种颜色．分别给出了任意两个图的团色数与它们通过笛卡尔积、Kronecker积、强直积或字典积运算后得到的积图的团色数之间的关系．     

*-代数自由积上的线性泛函的延拓

本文研究了C*-代数及其*-稠子代数的*-代数自由积.利用自由积的性质,得到了这两类自由积上的线性泛函到C*-代数(泛)自由积上的态延拓的充要条件,从而证明了这类延拓对于一般的C*-代数也是成立的.     

弱Hopf代数上的扭积

在弱Hopf代数上,定义了交叉积概念,并且得到了它的两种特殊形式冲积和扭积.特别地,给出了扭积为弱Hopf代数的一个充要条件,推广了Hopf代数的相应结论.     

扭Smash双积

设H是双代数 ,A是H 双模代数 ,且为左H 余模余代数 .本文构造一种新的代数—扭Smash双积A×H ,推广了扭Smash积和Smash双积 .我们给出了扭Smash双积A×H作成双代数的充要条件 ,证明了当A ,H都是Hopf代数时 ,A×H 也是Hopf代数 ,利用映射系统刻画了双代数A×H的结构 ,并考虑了它的对偶情况 .     

G可积函数的Lebesgue可测性

Botsko在连续和可导的知识基础上推广了Riemann积分,得到了一种新的积分,称为G积分．G积分既不同于Riemann积分也不同于Lebesgue积分．本文通过对G积分的研究,得到了G可积函数一定Lebesgue可测,从而有界G可积函数一定Lebesgue可积;同时我们还证明了这两个积分值相等．     

网络连通性的最优化

简述了极大边连通图和超边连通图;限制边连通度、极大限制边连通图和超限制边连通图的研究进展.     

On optimizing edge connectivity of product graphs

This work studies the super edge connectivity and super restricted edge connectivity of direct product graphs, Cartesian product graphs, strong product graphs and lexicographic product graphs. As a result, sufficient conditions for optimizing the edge connectivity and restricted edge connectivity of these graphs are presented.     

Invariants of Composite Networks Arising as a Tensor Product

We generalize Brylawski’s formula of the Tutte polynomial of a tensor product of matroids to colored connected graphs, matroids, and disconnected graphs. Unlike the non-colored tensor product where all edges have to be replaced by the same graph, our colored generalization of the tensor product operation allows individual edge replacement. The colored Tutte polynomials we compute exists by the results of Bollobás and Riordan. The proof depends on finding the correct generalization of the two components of the pointed Tutte polynomial, first studied by Brylawski and Oxley, and on careful enumeration of the connected components in a tensor product. Our results make the calculation of certain invariants of many composite networks easier, provided that the invariants are obtained from the colored Tutte polynomials via substitution and the composite networks are represented as tensor products of colored graphs. In particular, our method can be used to calculate (with relative ease) the expected number of connected components after an accident hits a composite network in which some major links are identical subnetworks in themselves.      

图的字典积的非零整数流(英文)

充分利用图的字典积的结构证明了以下结论:如果图G_1的每连通分支都非平凡,图G_2的阶数大于3,那么它们的字典积G_1[G_2]具有非零3-流.     

Super Edge-connectivity and Zeroth-order General Randić Index for −1 ≤ <Emphasis Type="Italic">α</Emphasis> &lt; 0

Let G be a connected graph with order n, minimum degree δ = δ(G) and edge-connectivity λ = λ(G). A graph G is maximally edge-connected if λ = δ, and super edge-connected if every minimum edgecut consists of edges incident with a vertex of minimum degree. Define the zeroth-order general Randi? index \(R_\alpha ^0\left( G \right) = \sum\limits_{x \in V\left( G \right)} {d_G^\alpha \left( x \right)} \), where d_G(x) denotes the degree of the vertex x. In this paper, we present two sufficient conditions for graphs and triangle-free graphs to be super edge-connected in terms of the zeroth-order general Randi? index for ?1 ≤ α < 0, respectively.     

Super Restricted Edge Connectivity of Regular Graphs

An edge cut of a connected graph is called restricted if it separates this graph into components each having order at least 2; a graph G is super restricted edge connected if G−S contains an isolated edge for every minimum restricted edge cut S of G. It is proved in this paper that k-regular connected graph G is super restricted edge connected if k > |V(G)|/2+1. The lower bound on k is exemplified to be sharp to some extent. With this observation, we determined the number of edge cuts of size at most 2k−2 of these graphs. Supported by NNSF of China (10271105); Ministry of Science and Technology of Fujian (2003J036); Education Ministry of Fujian (JA03147)     

Kronecker乘积图的超连通性(英文)

设G1和G2是两个连通图,则G1和G2的Kronecker积G1×G2定义如下:V(G1×G2)=V(G1)×V(G2),E(G1×G2)={(u1,v1)(u2,v2):u1u2∈E(G1),v1v2∈E(G2)}.我们证明了G×Kn(n≥4)超连通图当且仅当κ(G)n>δ(G)(n 1),其中G是任意的连通图,Kn是n阶完全图.进一步我们证明了对任意阶至少为3的连通图G,如果κ(G)=δ(G),则G×Kn(n≥3)超连通图.这个结果加强了郭利涛等人的结果.     

Characterization of Product Anti-Magic Graphs of Large Order

A graph G is product anti-magic if one can bijectively label its edges with integers 1, . . . ,e(G) so that no two vertices have the same product of incident labels. This property was introduced by Figueroa-Centeno, Ichishima, and Muntaner-Batle who in particular conjectured that every connected graph with at least 4 vertices is product anti-magic. Here, we completely describe all product anti-magic graphs of sufficiently large order, confirming the above conjecture in this case. Our proof uses probabilistic methods. Reverts to public domain 28 years from publication. Partially supported by the National Science Foundation, Grant DMS-0457512.     

几类新的上可嵌入图

讨论了几类上可嵌入的边连通简单图,得到了如下结果:若G为简单连通图,且满足以下条件1)-3)之一:1)G为1-边连通的,且不含完全图K_3,α(G)≤3,2)G为2-边连通的,且不含完全图K_3,α(G)≤5,3)G为3-边连通的,且不含完全图K_3,α(G)≤10,则G是上可嵌入的,且在上述相应条件下,独立数上界都分别是最好的.     

最大边连通和super-边连通超图的充分条件

设H是连通超图。若超图H的边连通度等于其最小度,则称H是最大边连通的。若超图H的每个最小边割总是由关联于某个最小度顶点的边集所构成,则称H是super-边连通的。首先给出一致线性超图是最大边连通超图的度序列条件。其次,给出一致线性超图是super-边连通超图的度条件。这些结果分别推广了Dankelmann和Volkmann（1997）以及Hellwig和Volkmann（2005）在图上的相关结论。