Skip to main content
SpringerLink
Log in

Computing the isoperimetric number of a graph

  • Brief Communications
  • Published:
Cybernetics and Systems Analysis 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

References

  1. N. L. Biggs, B. Mohar, and Shawe-Taylor, “The spectral radius of infinite graphs,” Bull. London Math. Soc.,20, 118–120 (1988).

    MathSciNet  Google Scholar 

  2. P. Buser. “On the bipartition of graphs, Discr. Appl. Math.,9, 105–109 (1984).

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Buser, “Cubic graphs and the first eigenvalue of Riemann surface,” Math. Z.,162, 87–99 (1978).

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Dodziuk, “Difference equations, isoperimetric inequality and transience of certain random walks,” Trans. AMS,24, 787–794 (1984).

    MathSciNet  Google Scholar 

  5. M. R. Garey, D. S. Johnson, and L. Stockmeyer, “Some simplified NP-complete graph problems,” Theor. Comput. Sci.,1, 237–267 (1976).

    Article  MathSciNet  Google Scholar 

  6. P. Gerl, “Eine isoperimetrische Eigenschaft von Baumen,” Sitzungsber. Osterr. Akad. Wiss., Auf. 2,195, 49–52 (1986).

    MATH  MathSciNet  Google Scholar 

  7. M. K. Goldberg and R. Gardner, “On the minimal cut problem,” in: Progress in Graph Theory, Academic Press, San Diego (1984), pp. 295–305.

    Google Scholar 

  8. B. Mohar, “Isoperimetric inequalities, growth and the spectrum of graphs,” Linear Algebra Appl.,103, 119–131 (1988).

    Article  MATH  MathSciNet  Google Scholar 

  9. B. Mohar, “Isoperimetric number of graphs,” J. Comb. Theory, Ser. B,47, 274–291 (1989).

    Article  MATH  MathSciNet  Google Scholar 

  10. N. T. Varopoulos, “Isoperimetric inequalities and Markov chains,” J. Funct. Anal.,63, 215–239 (1985).

    MATH  MathSciNet  Google Scholar 

Download references

Authors
  1. P. A. Golovach
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 167–172, May–June, 1994

Rights and permissions

Reprints and permissions

About this article

Cite this article

Golovach, P.A. Computing the isoperimetric number of a graph. Cybern Syst Anal 30, 453–457 (1994). https://doi.org/10.1007/BF02366479

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation