Double-super-connected digraphs |
| |
Authors: | Juan Liu Jixiang Meng |
| |
Affiliation: | a College of Mathematics-Physics and Information Sciences, Xinjiang Normal University, Urumqi, Xinjiang, 830054, PR China b College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, PR China |
| |
Abstract: | A strongly connected digraph D 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 D 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. |
| |
Keywords: | Super-connected Double-super-connected Line digraphs Cartesian product Lexicographic product |
本文献已被 ScienceDirect 等数据库收录! |
|