Skip to main content
SpringerLink
Log in

Indecomposable switching graph with the number of verticesN log2 N−9/4N

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

We propose a new algorithm for constructing switching graphs with many entries and few internal vertices.

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. A. A. Arkhangel'skaya, V. A. Ershov, and V. I. Neiman,Automatic Commutation of Communication Channels [in Russian], Svyaz', Moscow (1970).

    Google Scholar 

  2. L. A. Bassalygo, I. I. Grushko, and V. I. Neiman, “Some theorems on the structure of one-time commutation indecomposable systems,”Problemy Peredachi Informatsii [Problems Inform. Transmission],5, No. 2, 45–52 (1962).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rostov State University, USSR

    M. G. Adigeev

Authors
  1. M. G. Adigeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated fromMatematicheskie Zametki, Vol. 58, No. 3, pp. 323–333, September, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adigeev, M.G. Indecomposable switching graph with the number of verticesN log2 N−9/4N . Math Notes 58, 897–904 (1995). https://doi.org/10.1007/BF02304765

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation