Descendant-homogeneous digraphs

The descendant setdesc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is the union of finitely many descendant sets, and D is descendant-homogeneous if it is vertex transitive and any isomorphism between finitely generated subdigraphs extends to an automorphism. We consider connected descendant-homogeneous digraphs with finite out-valency, specially those which are also highly arc-transitive. We show that these digraphs must be imprimitive. In particular, we study those which can be mapped homomorphically onto Z and show that their descendant sets have only one end.There are examples of descendant-homogeneous digraphs whose descendant sets are rooted trees. We show that these are highly arc-transitive and do not admit a homomorphism onto Z. The first example (Evans (1997) [6]) known to the authors of a descendant-homogeneous digraph (which led us to formulate the definition) is of this type. We construct infinitely many other descendant-homogeneous digraphs, and also uncountably many digraphs whose descendant sets are rooted trees but which are descendant-homogeneous only in a weaker sense, and give a number of other examples.     

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree

The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r−1 contains at least r vertex-disjoint directed cycles. Thomassen proved that it is true when r=2, and very recently the conjecture was proved for the case where r=3. It is still open for larger values of r, even when restricted to (regular) tournaments. In this paper, we present two proofs of this conjecture for tournaments with minimum in-degree at least 2r−1. In particular, this shows that the conjecture is true for (almost) regular tournaments. In the first proof, we prove auxiliary results about union of sets contained in another union of sets, that might be of independent interest. The second one uses a more graph-theoretical approach, by studying the properties of a maximum set of vertex-disjoint directed triangles.     

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

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

Improved upper and lower bounds for the spectral radius of digraphs

Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on ρ(G) are given. We show that some known bounds can be obtained from our bounds.     

图的m-距离染色

图的染色问题具有广泛的实际应用背景,其与计算机网络结构、银行安全密码、电信通讯站点的频率分配以及人力资源配置等问题均有重要的联系。作为图的正常染色的自然推广,学者们提出了图的强染色（即2-距离染色）乃至 m -距离（m为正整数）染色的概念。文章在此基础上,定义了有向图的 m -距离染色,并研究了无向图和有向图的 m -距离染色问题,运用图论的相关技巧及标号排序等方法获得了圈、树、路、星图、有向圈、有向树的 m -距离色数,及一般无向图和有向图其 m -距离色数的上、下界。     

氟化氢团簇(HF)_n(n=2～8)拓扑性区别氢键构型的图论列举法和量子化学计算法研究

利用提出的图论程序列举出氟化氢团簇(HF)_n(n=2~8)所有可能存在的拓扑性区别氢键构型,通过精密调查获得有可能存在的拓扑性区别构型,发现了满足HF团簇稳定性的若干条件,在这些条件的基础上编写FORTRAN程序和Python语言执行程序,再用画图软件包Graph Viz2.37自动画出对应的有向图或条件性有向图.以对应的有向图作理论框架,分别利用从头算法Moller-Plesset(MP2)二级微扰方法和密度泛函理论(DFT)方法 B3LYP计算水平的6-31G**(d,p)基组对氟化氢团簇(HF)_n(n=3~7)所有拓扑性区别条件性有向图对应的初始结构进行结构优化并作振动频率分析,获得氟化氢团簇(HF)_n(n=2~7)的最稳定构型,发现了氟化氢团簇的五聚体(HF)_5、六聚体(HF)_6和七聚体(HF)_7等一些新的稳定结构.     

Easy and hard instances of arc ranking in directed graphs

In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that deciding whether , where G is an acyclic orientation of a 3-partite graph is an NP-complete problem. In this way we answer an open question stated by Kratochvil and Tuza in 1999.