Super-connected but not super edge-connected graphs

https://doi.org/10.1016/j.ipl.2010.10.005Get rights and content

Abstract

A connected graph G is super-connected (resp. super edge-connected) if every minimum vertex-cut (resp. edge-cut) isolates a vertex of G. In [Super connectivity of line graphs, Inform. Process. Lett. 94 (2005) 191–195], Xu et al. shows that a super-connected graph with minimum degree at least 4 is also super edge-connected. In this paper, a characterization of all super-connected but not super edge-connected graphs is given. It follows from this result that there is a unique super-connected but not super edge-connected graph with minimum degree 3, that is, the Ladder graph L3 of order 6, and that there are infinitely many super-connected but not super edge-connected graphs with minimum degree 1 or 2.

Research highlights

► Two new classes of super-connected but not super edge-connected graphs are constructed. ► All super-connected but not super edge-connected graphs are characterized.

References (21)

  • C. Balbuena et al.

    Superconnectivity of regular graphs with small diameter

    Discrete Appl. Math.

    (2009)
  • D. Bauer et al.

    Connectivity extremal problems and the design of reliable probabilistic networks

  • F.T. Boesch

    Synthesis of reliable networks: A survey

    IEEE Trans. Reliability

    (1986)
  • F.T. Boesch et al.

    Circulant and their connectivities

    J. Graph Theory

    (1984)
  • C. Godsil et al.

    Algebraic Graph Theory

    (2001)
  • A. Hellwig et al.

    Note on the connectivity of line graphs

    Inform. Process. Lett.

    (2004)
  • A. Hellwig et al.

    Maximally edge-connected and vertex-connected graphs and digraphs: A survey

    Discrete Math.

    (2008)
  • Q. Li et al.

    Super edge connectivity properties of connected edge symmetric graphs

    Networks

    (1999)
  • X. Liang et al.

    Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs

    Graphs Combin.

    (2007)
  • M. Lü et al.

    On super connectivity of cartesian product graphs

    Networks

    (2008)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 2010 Elsevier B.V. All rights reserved.