Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
نویسندگان
چکیده
منابع مشابه
Supereulerian Digraphs with Large Arc-Strong Connectivity
Let D be a digraph and let λ(D) be the arc-strong connectivity of D, and α′(D) be the size of a maximum matching of D. We proved that if λ(D) ≥ α′(D) > 0, then D has a spanning eulerian subdigraph. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 81: 393–402, 2016
متن کاملOn Arc Connectivity of Direct-Product Digraphs
Various product operations are employed for constructing larger networks from smaller ones, among which direct-product operation is the most frequently employed one. The direct product of two graphs G1 andG2, denoted byG1×G2, is defined on vertex set V G1 ×V G2 , where two vertices x1, x2 and y1, y2 are adjacent to each other in G1 × G2 if and only if x1y1 ∈ E G1 and x2y2 ∈ E G2 . Other names f...
متن کاملStrong Subgraph $k$-connectivity
Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations of undirected graphs. In this paper, we introduce a natural extension of generalized k-connectivity of undirected graphs to directed graphs (we call it stro...
متن کاملOn Restricted Arc-connectivity of Regular Digraphs
The restricted arc-connectivity λ′ of a strongly connected digraph G is the minimum cardinality of an arc cut F in G such that every strongly connected component of G−F contains at least two vertices. This paper shows that for a d-regular strongly connected digraph with order n and diameter k ≥ 4, if λ′ exists, then λ′(G) ≥ min { (n − dk−1)(d− 1) dk−1 + d− 2 , 2d− 2 } As consequences, the restr...
متن کاملStrong subgraph $k$-connectivity bounds
Let D = (V,A) be a digraph of order n, S a subset of V of size k and 2 ≤ k ≤ n. Strong subgraphs D1, . . . , Dp containing S are said to be internally disjoint if V (Di)∩V (Dj) = S and A(Di)∩A(Dj) = ∅ for all 1 ≤ i < j ≤ p. Let κS(D) be the maximum number of internally disjoint strong digraphs containing S in D. The strong subgraph kconnectivity is defined as κk(D) = min{κS(D) | S ⊆ V, |S| = k}...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2022
ISSN: ['1234-3099', '2083-5892']
DOI: https://doi.org/10.7151/dmgt.2479