On the super‐restricted arc‐connectivity of s ‐geodetic digraphs

For a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum cardinality of an arc-cut over all arc-cuts S satisfying that D - S has a non-trivial strong component D1 such that D - V (D1) contains an arc. In this paper we prove that every digraph on at least 4 vertices and of minimum degree at least 2 is λ′ -connected and λ′(D) ≤ξ′(D), where ξ′(D) is the minimum arc-degree of D. Also in this paper we introduce the concept of super- λ′ digraphs and provide a sufficient condition for an s -geodetic digraph to be super- λ′. Further, we show that the h -iterated line digraph Lh(D) of an s -geodetic digraph is super- λ′ for a particular h. © 2012 Wiley Periodicals, Inc. NETWORKS, 2013 © 2013 Wiley Periodicals, Inc.

[1]  Camino Balbuena,et al.  Diameter, short paths and superconnectivity in digraphs , 2004, Discret. Math..

[2]  S. Louis Hakimi,et al.  On Computing a Conditional Edge-Connectivity of a Graph , 1988, Inf. Process. Lett..

[4]  C. Wang,et al.  Semisymmetric cubic graphs as regular covers of K3,3 , 2008 .

[5]  Miguel Angel Fiol,et al.  Extraconnectivity of graphs with large girth , 1994, Discret. Math..

[6]  Miguel Angel Fiol,et al.  Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.

[7]  Miguel Angel Fiol,et al.  On the extraconnectivity of graphs , 1996, Discret. Math..

[8]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[9]  Camino Balbuena,et al.  On the restricted arc-connectivity of s-geodetic digraphs , 2010 .

[10]  Miguel Angel Fiol,et al.  Extraconnectivity of graphs with large minimum degree and girth , 1997, Discret. Math..

[11]  M. Aigner.  On the linegraph of a directed graph , 1967 .

[12]  Camino Balbuena,et al.  Numbers of edges in supermagic graphs , 2006 .

[13]  Jianping Ou,et al.  Edge cuts leaving components of order at least m , 2005, Discret. Math..

[14]  Frank Harary,et al.  Connectivity in digraphs , 1971 .

[15]  Camino Balbuena,et al.  Superconnected digraphs and graphs with small conditional diameters , 2002, Networks.

[16]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.

[17]  Camino Balbuena,et al.  Diameter-girth sufficient conditions for optimal extraconnectivity in graphs , 2008, Discret. Math..

[18]  Yahya Ould Hamidoune.  Sur la separation dans les graphes de Cayley abeliens , 1985, Discret. Math..

[19]  Miguel Angel Fiol,et al.  Distance connectivity in graphs and digraphs , 1996 .

[20]  Angelika Hellwig,et al.  Maximally edge-connected and vertex-connected graphs and digraphs: A survey , 2008, Discret. Math..

[21]  F. Boesch.  Synthesis of reliable networks - a survey , 1986, IEEE Transactions on Reliability.

[22]  Camino Balbuena.  Extraconnectivity of s-geodetic digraphs and graphs , 1999, Discret. Math..

[23]  Shiying Wang,et al.  λ'-optimal digraphs , 2008 .

[24]  Miguel Angel Fiol,et al.  On the order and size of s-geodetic digraphs with given connectivity , 1997, Discret. Math..

[25]  Xing Chen,et al.  The restricted arc connectivity of Cartesian product digraphs , 2009, Inf. Process. Lett..

[26]  Mirka Miller,et al.  Diameter-sufficient conditions for a graph to be super-restricted connected , 2008, Discret. Appl. Math..

[27]  Zhao Zhang,et al.  A proof of an inequality concerning k-restricted edge connectivity , 2005, Discret. Math..

[28]  Bao Gang Xu,et al.  A structural theorem on embedded graphs and its application to colorings , 2009 .

[29]  Qiao Li,et al.  Conditional edge connectivity properties, reliability comparisons and transitivity of graphs , 2002, Discret. Math..

[30]  Lutz Volkmann,et al.  Restricted arc-connectivity of digraphs , 2007, Inf. Process. Lett..

[31]  Jun-Ming Xu,et al.  On restricted edge-connectivity of graphs , 2002, Discret. Math..

[32]  Yahya Ould Hamidoune.  A property of a-fragments of a digraph , 1980, Discret. Math..