Connectivity of half vertex transitive digraphs

Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang and Fengxia Liu

Applied Mathematics and Computation, 2018, vol. 316, issue C, 25-29

Abstract: A bipartite digraph is said to be a half vertex transitive digraph if its automorphism acts transitively on the sets of its bipartition, respectively. In this paper, bipartite double coset digraphs of groups are defined and it is shown that any half vertex transitive digraph is isomorphic to some half double coset digraph, and we show that the connectivity of any strongly connected half transitive digraph is its minimum degree.

Keywords: Digraphs; Half vertex transitive digraphs; Half double coset digraphs (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031730557X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:316:y:2018:i:c:p:25-29

DOI: 10.1016/j.amc.2017.08.006

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().