Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420371 | Discrete Applied Mathematics | 2010 | 5 Pages |
Abstract
A strongly connected digraph DD is said to be super-connected if every minimum vertex-cut is the out-neighbor or in-neighbor set of a vertex. A strongly connected digraph DD is said to be double-super-connected if every minimum vertex-cut is both the out-neighbor set of a vertex and the in-neighbor set of a vertex. In this paper, we characterize the double-super-connected line digraphs, Cartesian product and lexicographic product of two digraphs. Furthermore, we study double-super-connected Abelian Cayley digraphs and illustrate that there exist double-super-connected digraphs for any given order and minimum degree.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Juan Liu, Jixiang Meng, Zhao Zhang,