Skip to main content
SpringerLink
Log in

Sufficient Conditions for Super-Arc-Strongly Connected Oriented Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A digraph D is called super-arc-strongly connected if the arcs of every its minimum arc-disconnected set are incident to or from some vertex in D. A digraph without any directed cycle of length 2 is called an oriented graph. Sufficient conditions for digraphs to be super-arc-strongly connected have been given by several authors. However, closely related conditions for super-arc-strongly connected oriented graphs have little attention until now. In this paper we present some minimum degree and degree sequence conditions for oriented graphs to be super-arc-strongly connected.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)

  2. Boesch, F.T.: Synthesis of reliable networks-a survey. IEEE Trans. Reliab.35, 240–246 (1986)

    Google Scholar 

  3. Soneoka, T.: Super-edge-connectivity of dense digraphs and graphs. Discrete Appl. Math. 37/38, 511–523 (1992)

    Google Scholar 

  4. Fàbrega, J., Fiol, M.A.: Maximally connected digraphs. J. Graph Theory 13, 657–668 (1989)

    Google Scholar 

  5. Fiol, M.A., Fàbrega, J., Escudero, M.: Short paths and connectivity in graphs and digraphs, Ars Combin. 29 B, 17–31 (1990)

  6. Marcote, X., Balbuena, C., Pelayo, I.: Diameter, short paths and superconnectivity in digraphs. Discrete Math. 288, 113–123 (2004)

    Google Scholar 

  7. Balbuena, C., Carmona, A., Fàbrega, J., Fiol, M.A.: Superconnectivity of bipartite digraphs and graphs. Discrete Math. 197/198, 61–75 (1999)

    Google Scholar 

  8. Fiol, M.A.: On super-edge-connected digraphs and bipartite digraphs. J. Graph Theory 16, 545-555 (1992)

    Google Scholar 

  9. Bondy, J.A., Murty, U.S.R.: Graph Theory with Apllications. Macmillan, New York (1976)

Download references

Author information

Author notes

  1. Shiying Wang

    Present address: School of Mathematical Sciences, Shanxi University, Taiyuan, 030006, People’s Republic of China

Authors and Affiliations

  1. School of Mathematical Sciences, Shanxi University, Taiyuan, 030006, People’s Republic of China

    Jun Yuan

  2. Business College of Shanxi University, Taiyuan, 030031, People’s Republic of China

    Aixia Liu

Authors
  1. Shiying Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Aixia Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, S., Yuan, J. & Liu, A. Sufficient Conditions for Super-Arc-Strongly Connected Oriented Graphs. Graphs and Combinatorics 24, 587–595 (2008). https://doi.org/10.1007/s00373-008-0810-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-008-0810-z

Keywords

Search

Navigation