当前位置: X-MOL 学术J. Graph Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
k‐quasi‐transitive digraphs of large diameter
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2020-06-27 , DOI: 10.1002/jgt.22614
Jesús Alva‐Samos 1 , César Hernández‐Cruz 2
Affiliation  

Given an integer k with k 2 , a digraph D = ( V D , A D ) is k ‐quasi‐transitive if for every u v ‐directed path of length k in D , we have ( u , v ) A D or ( v , u ) A D (or both). In this study, we prove that if k is an odd integer, k 5 , then every strong k ‐quasi‐transitive digraph of diameter at least k + 2 admits a partition of its vertex set V D = ( V 1 , V 2 ) such that D [ V 1 ] is Hamiltonian, and both D [ V 1 ] and D [ V 2 ] are semicomplete bipartite, when D is bipartite, or semicomplete, otherwise. As a consequence, for an odd integer k 3 , it is easy to prove that every non‐bipartite strong k ‐quasi‐transitive digraph with diameter at least k + 2 has a Hamiltonian path.

中文翻译:

大直径的k-拟传递有向图

给定一个整数 ķ ķ 2 d = V d 一种 d ķ 准传递 ü v 长度方向 ķ d , 我们有 ü v 一种 d 要么 v ü 一种 d (或两者)。在这项研究中,我们证明 ķ 是一个奇数整数, ķ 5 ,那么每个强者 ķ 直径的准传递图 ķ + 2 接受其顶点集的分区 V d = V 1个 V 2 这样 d [ V 1个 ] 是汉密尔顿式的 d [ V 1个 ] d [ V 2 ] 是半完全二分法 d 是二部或半完全的,否则。结果,对于奇数整数 ķ 3 ,很容易证明每个非二元性 ķ 至少直径的准传递图 ķ + 2 有哈密尔顿路径。
更新日期:2020-06-27
down
wechat
bug