Restricted connectivity of total digraph-Reference-Cited by-同舟云学术

Restricted connectivity of total digraph

Published:2016-05-26 Issue:02 Volume:08 Page:1650022
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Liu Zhenhua¹,Zhang Zhao²^ORCID

Affiliation:

1. Shihezi No. 1 Middle School, Shihezi, Xinjiang 832000, P. R. China

2. College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China

Abstract

For a strongly connected digraph [Formula: see text], an arc-cut [Formula: see text] is a [Formula: see text]-restricted arc-cut of [Formula: see text] if [Formula: see text] has at least two strong components of order at least [Formula: see text]. The [Formula: see text]-restricted arc-connectivity [Formula: see text] is the minimum cardinality of all [Formula: see text]-restricted arc-cuts. The [Formula: see text]-restricted vertex-connectivity [Formula: see text] can be defined similarly. In this paper, we provide upper and lower bounds for [Formula: see text] and [Formula: see text] for the total digraph [Formula: see text] of [Formula: see text].

Funder

National Natural Science Foundation of China

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830916500221

Reference11 articles.

1. Graph Theory

2. On computing a conditional edge-connectivity of a graph

3. On cyclic vertex-connectivity of Cartesian product digraphs

4. Super Connectivity of Line Graphs and Digraphs

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs;Discussiones Mathematicae Graph Theory;2019