Some generalizations of Menger's theorem concerning arc-connected digraphs
نویسندگان
چکیده
منابع مشابه
Super-connected arc-transitive digraphs
A digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set or in-neighbor set of a vertex. A digraph is said to be reducible, if there are two vertices with the same out-neighbor set or the same in-neighbor set. In this paper, we prove that a strongly connected arc-transitive oriented graph is either reducible or super-connected. Furthermore, if this digraph is ...
متن کاملSome constructions of highly arc-transitive digraphs
We construct infinite highly arc-transitive digraphs with finite out-valency and whose sets of descendants are digraphs which have a homomorphism onto a directed (rooted) tree. Some of these constructions are based on [4] and [5], and are shown to have universal reachability
متن کاملSome Generalizations of Fedorchuk Duality Theorem – I
Generalizing Duality Theorem of V. V. Fedorchuk [11], we prove Stone-type duality theorems for the following four categories: all of them have as objects the locally compact Hausdorff spaces, and their morphisms are, respectively, the continuous skeletal maps, the quasi-open perfect maps, the open maps, the open perfect maps. In particular, a Stone-type duality theorem for the category of all c...
متن کاملSome considerations concerning volume-modulated arc therapy
In this paper it is formally shown that the dynamic multileaf collimator (MLC) IMRT delivery technique remains valid if the MLC is supported on a 1D moving platform. It is also shown that, in such circumstances, it is always time preferable to deliver overlapping modulating fields as a single swept field rather than as separate fields. The most general formulism is presented and then related to...
متن کاملDegree sequence for k-arc strongly connected multiple digraphs
Let D be a digraph on [Formula: see text]. Then the sequence [Formula: see text] is called the degree sequence of D. For any given sequence of pairs of integers [Formula: see text], if there exists a k-arc strongly connected digraph D such that d is the degree sequence of D, then d is realizable and D is a realization of d. In this paper, characterizations for k-arc-connected realizable sequenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00129-x