Skip to main content
SpringerLink
Log in

The number of cut vertices and cut arcs in a strong directed graph

  • Published:
Acta Mathematica Academiae Scientiarum Hungaricae Aims and scope Submit manuscript

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

References

  1. C. Berge,The theory of graphs and its applications, Methuen and Co., London, 1962.

    MATH  Google Scholar 

  2. R. P. Gupta, On basis digraphs,J. Comb. Theory,3 (1967), pp. 16–24.

    MATH  Google Scholar 

  3. F. Harary andEd. Palmer, The groups of the small digraphs,J. Indian. Stat. Assoc.,4 (1966), pp. 155–169.

    MathSciNet  Google Scholar 

  4. G. Korvin, Some combinatorial problems in complete directed graphs,Theory of graphs, International Symposium, Rome, 1966.

  5. A. Ramachandra Rao, An extremal problem in Graph Theory,Israel J. Math.,6 (1968), pp. 261–266.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Statistical Institute, 203 Barrackpore Trunk Road, Calcutta-35, India

    S. B. Rao & A. Ramachandra Rao

Authors
  1. S. B. Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ramachandra Rao
    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

Rao, S.B., Ramachandra Rao, A. The number of cut vertices and cut arcs in a strong directed graph. Acta Mathematica Academiae Scientiarum Hungaricae 22, 411–421 (1971). https://doi.org/10.1007/BF01896438

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01896438

Keywords

Search

Navigation