On the spanning connectivity of the generalized Petersen graphs P(n,3)

In this paper, we employed lattice model to describe the three internally vertex-disjoint paths that span the vertex set of the generalized Petersen graph $P(n,3)$. We showed that the $P(n,3)$ is 3-spanning connected for odd $n$. Based on the lattice model, five amalgamated and one extension mechanisms are introduced to recursively establish the 3-spanning connectivity of the $P(n,3)$. In each amalgamated mechanism, a particular lattice trail was amalgamated with the lattice trails that was dismembered, transferred, or extended from parts of the lattice trails for $P(n?6,3)$, where a lattice tail is a trail in the lattice model that represents a path in $P(n,3)$.     

Inducibility of directed paths

A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more tractable. Here we resolve this problem in the setting of oriented graphs without transitive triangles.     

Long cycles and spanning subgraphs of locally maximal 1-planar graphs

A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges induce a complete subgraph, then the graph is locally maximal 1-planar. For a 3-connected locally maximal 1-planar graph G, we show the existence of a spanning 3-connected planar subgraph and prove that G is Hamiltonian if G has at most three 3-vertex-cuts, and that G is traceable if G has at most four 3-vertex-cuts. Moreover, infinitely many nontraceable 5-connected 1-planar graphs are presented.     

对偶导集及其应用

借助对偶范畴的思想和方法在点集拓扑学中引入了对偶导集概念,讨论了对偶导集和对偶导集运算的相关性质.并以此为基础引入了对偶连通空间的概念,讨论了对偶连通空间和连通空间之间的关系,借此给出了不连通空间的几个等价刻画.为拓扑空间的研究提供了新的途径.     

围长为2的偶数阶本原极小强连通有向图的1一指数集

本文研究了围长为2的n阶本原极小强连通有向图的1-指数集,证明了：当n（≥4）为偶数时,E（1）={4,5,6,7,…,2n-4）,无缺数段。     

任意基数集上的拟阵的圈及连通性

通过研究任意基数集上的拟阵圈的性质,继而得出当此拟阵连通时,它可由含任一给定元素的圈集唯一确定的结论.     

Families of pairs of graphs with a large number of common cards

The vertex‐deleted subgraph G?v, obtained from the graph G by deleting the vertex v and all edges incident to v, is called a card of G. The deck of G is the multiset of its unlabelled vertex‐deleted subgraphs. The number of common cards of G and H (or between G and H) is the cardinality of the multiset intersection of the decks of G and H. In this article, we present infinite families of pairs of graphs of order n ≥ 4 that have at least \begin{eqnarray*}2\lfloor\frac{1}{3}(n-1)\rfloor\end{eqnarray*} common cards; we conjecture that these, along with a small number of other families constructed from them, are the only pairs of graphs having this many common cards, for sufficiently large n. This leads us to propose a new stronger version of the Reconstruction Conjecture. In addition, we present an infinite family of pairs of graphs with the same degree sequence that have \begin{eqnarray*}\frac{2}{3}(n+5-2\sqrt{3n+6})\end{eqnarray*} common cards, for appropriate values of n, from which we can construct pairs having slightly fewer common cards for all other values of n≥10. We also present infinite families of pairs of forests and pairs of trees with \begin{eqnarray*}2\lfloor\frac{1}{3}(n-4)\rfloor\end{eqnarray*} and \begin{eqnarray*}2\lfloor\frac{1}{3}(n-5)\rfloor\end{eqnarray*} common cards, respectively. We then present new families that have the maximum number of common cards when one graph is connected and the other disconnected. Finally, we present a family with a large number of common cards, where one graph is a tree and the other unicyclic, and discuss how many cards are required to determine whether a graph is a tree. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 146–163, 2010     

Cone Length for DG Modules and Global Dimension of DG Algebras

As the definition of free class of differential modules over a commutative ring in [1 Avramov , L. L. , Buchweitz , R.-O. , Iyengar , S. ( 2007 ). Class and rank of differential modules . Invent. Math. 169 : 1 – 35 .[Crossref], [Web of Science ®] , [Google Scholar]], we define DG free class for semifree DG modules over an Adams connected DG algebra A. For any DG A-modules M, we define its cone length as the least DG free classes of all semifree resolutions of M. The cone length of a DG A-module plays a similar role as projective dimension of a module over a ring does in homological ring theory. The left (resp., right) global dimension of an Adams connected DG algebra A is defined as the supremum of the set of cone lengths of all DG A-modules (resp., A ^op -modules). It is proved that the definition is a generalization of that of graded algebras. Some relations between the global dimension of H(A) and the left (resp. right) global dimension of A are discovered. When A is homologically smooth, we prove that the left (right) global dimension of A is finite and the dimension of D(A) and D ^c (A) are not bigger than the DG free class of a minimal semifree resolution X of the DG A ^e -module A.