Locally-finite connected-homogeneous digraphs
Locally-finite connected-homogeneous digraphs
复制标题
局部有限连通齐次有向图
DOI:
10.1016/j.disc.2010.12.017
复制
发表时间:
2011
影响因子:
0.8
通讯作者:
Gray R
中科院分区:
文献类型:
--
作者:
Gray R
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that the digraph embeds a triangle we give a complete classification, obtaining a family of tree-like graphs constructed by gluing together directed triangles. In the triangle-free case we show that these digraphs are highly arc-transitive. We give a classification in the two-ended case, showing that all examples arise from a simple construction given by gluing along a directed line copies of some fixed finite directed complete bipartite graph. When the digraph has infinitely many ends we show that the descendants of a vertex form a tree, and the reachability graph (which is one of the basic building blocks of the digraph) is one of: an even cycle, a complete bipartite graph, the complement of a perfect matching, or an infinite semiregular tree. We give examples showing that each of these possibilities is realised as the reachability graph of some connected-homogeneous digraph, and in the process we obtain a new family of highly arc-transitive digraphs without property Z.
登录
查看更多内容
DOI:
--
发表时间:
2005
期刊:
European journal of combinatorics (Print)
影响因子:
--
作者:
A. Malnic;D. Marušič;R. G. Möller;N. Seifter;V. Trofimov;B. Zgrablic
通讯作者:
B. Zgrablic
DOI:
--
发表时间:
1993
期刊:
影响因子:
--
作者:
R. Diestel;H. A. Jung;R. G. Möller
通讯作者:
R. G. Möller
DOI:
10.1090/s0002-9947-1984-0743728-1
发表时间:
1984
影响因子:
1.3
作者:
A. Lachlan;Ron Morrow;Robert E. Woodrow
通讯作者:
Robert E. Woodrow
DOI:
--
发表时间:
1982
期刊:
Comb.
影响因子:
--
作者:
H. D. Macpherson
通讯作者:
H. D. Macpherson
DOI:
--
发表时间:
2010
期刊:
影响因子:
--
作者:
M. Hamann;F. Hundertmark
通讯作者:
F. Hundertmark