Skip to main content
SpringerLink
Log in

Upper and lower bounds of the number of edges of a graph with specified compactness, noncompactness, and all-contiguity number

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. A. A. Zykov, Theory of Finite Graphs. I [in Russian], Izd. Nauka, Moscow (1969).

    Google Scholar 

  2. N. G. Vinnichenko, “Upper bound of the number of edges of a graph with specified noncompactness and all-contiguity number,” Kibernetika, No. 1, Kiev (1972).

  3. N. G. Vinnichenko and M. I. Kratko, “Upper and lower bounds of the number of edges of a graph with specified compactness and all-contiguity number,” in: Theoretical Cybernetics [in Russian], Izd. Inst. Kibernet., Akad. Nauk UkrSSR, Kiev (1971).

    Google Scholar 

  4. O. Ore, Theory of Graphs, American Mathematics Society (1967).

  5. O. B. Lupanov, “On the possibilities of synthesizing circuits from arbitrary elements,” Trudy Matem. Inst. im. V. A. Steklova,51, Moscow (1958).

  6. B. A. Trakhtenbrot, “On the theory of repetition-free contact circuits,” Trudy Matem. Inst. im. V. A. Steklova, Vol.51, Moscow (1958).

Download references

Authors
  1. N. G. Vinnichenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

We feel obliged to point out the following alternative translations to certain Russian mathematical terms: for “compactness” [plotnost'] read “internal stability number”; for “noncompactness” (neplotnost') read “independence number”; and for “all-contiguity number” (chislo vsesmezhnosti) read “external stability number.” For further clarification, see “Theory of Graphs” by O. Ore-Publisher.

Translated from Kibernetika, No. 1, pp. 87–90, January–February, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vinnichenko, N.G. Upper and lower bounds of the number of edges of a graph with specified compactness, noncompactness, and all-contiguity number. Cybern Syst Anal 9, 101–105 (1973). https://doi.org/10.1007/BF01068671

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation