Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly, not much has been investigated for directed graphs. In this article, we study 2-edge connectivity problems in directed graphs and, in ...
On the edge-connectivity of graphs with two orbits of the same size It is well known that the edge-connectivity of a simple, connected, vertex-transitive graph attains its regular degree. It is then natural to consider the ... W Yang,Z Zhang,X Guo,... 被引量: 13发表: 2011年 MAINTEN...
For an Abelian group A, let 〈A〉 denote the family of graphs that are A-connected. The nowhere-zero flow problems were introduced by Tutte [8] and surveyed by Jaeger in [4] and by Zhang in [11]. The concept of A-connectivity was introduced by Jaeger et al. in [5], where A-...
Approximating the small- est spanning subgraph for 2-edge-connectivity in directed graphs. In Proc. 23rd European Symposium on Algorithms, pages 582-594, 2015.L. Georgiadis, G. F. Italiano, C. Papadopoulos, and N. Parotsidis. Approximating the small- est spanning subgraph for 2-edge-...
Suri, Fully Dynamic 2-Edge-Connectivity in Planar Graphs, Proc. 3rd Scandinavian Workshop on Algorithm Theory , Lecture Notes in Computer Science, Vol. 621, Springer-Verlag, Berlin, 1992, pp. 233–244.D. Giammarresi, and G. R. Italiano, Dynamic 2- and 3-connectivity on planar graphs. ...
Xu J M. Some results on R2-edge-connectivity of even regular graphs[J]. Appl. Math. -JCU, 1999, 14B(3):366-370.Xu J M.Some results on R2-edge-connectivity of even regular graphs.Journal of Applied Mathematics. 1999Xu J M.Some results on R2-edge-connectivity of even regular graphs...
Fully dynamic algorithms for 2-edge-connectivity - Galil, Italiano - 1992 () Citation Context ...mic graphs. Demetrescu and Italiano [13] presented a fully dynamic algorithm for maintaining all pair shortest paths in dynamic directed graphs with real-valued edge weights. Galil and Italiano [14...
Applying this property we characterize the super restricted edge connected graphs with diameter 2 which satisfy a type of neighborhood condition. This result improves the previous related one which was given by Wang et al. [S. Wang, J. Li, L Wu, S. Lin, Neighborhood conditions for graphs ...
Edge-connectivity and super edge-connectivity of P 2 -path graphs[J] . Camino Balbuena,Daniela Ferrero.Discrete Mathematics . 2003 (1)Camino Balbuena and Daniela Ferrero.Edge-connectivity and super edge-connectivity of Ppath graphs.Discrete Mathematics. 2003...
proposed the concept of generalized $ k $-edge-connectivity $ \\lambda_k(G) $. In this paper, we obtain exact values or sharp upper and lower bounds of $ \\kappa_k(G) $ and $ \\lambda_k(G) $ for join, corona and cluster graphs....