Maximally connected and super arc-connected bi-Cayley digraphs.

MaRDI QIDQ2828889zbMATH OpenFDO

Authors Thomas Y. H. Liu, Jixiang Meng

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.4627

zbMATH Keywords

atombi-Cayley digraph\(\lambda\)-atom\(\lambda\)-superatom

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Abstract: Let X=(V, E) be a digraph. X is maximally connected, if kappa(X)=delta(X). X is maximally arc-connected, if lambda(X)=delta(X). And X is super arc-connected, if every minimum arc-cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that the strongly connected Bi-Cayley digraphs are maximally connected and maximally arc-connected, and the most of strongly connected Bi-Cayley digraphs are super arc-connected.

Recommendations

• Sufficient conditions for digraphs to be maximally connected and super-connected
• Sufficient conditions for super-arc-connected digraphs
• Bi-super-connected digraphs
• Arc connectivity of balanced half-transitive digraphs
• Super-connected arc-transitive digraphs

Cited in

(2)

• Arc connectivity of balanced half-transitive digraphs
• scientific article; zbMATH DE number 5671145 (Why is no real title available?)

This page was built for publication: Maximally connected and super arc-connected bi-Cayley digraphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828889)