Skip to main content
SpringerLink
Log in

Coding and counting spanning trees in Kleitman-Golden graphs

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Spanning trees of squares (in Harary's sense) of simple chains and simple cycles are coded by words in a three-letter alphabet. Counting of spanning trees in these graphs is reduced to counting of code words by the generating function method for ordered partitions.

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

Literature Cited

  1. F. Harary, Graph Theory, Addison-Wesley, Reading, MA (1969).

    Google Scholar 

  2. S. Bedrosian, “The Fibonacci numbers via trigonometric expressions,” J. Franklin Inst.,295, No. 2, 175–177 (1973).

    Google Scholar 

  3. D. J. Kleitman and B. Golden, “Counting trees in a certain class of graphs,” Am. Math. Monthly,82, No. 1, 40–44 (1975).

    Google Scholar 

  4. S. Chaiken and D. J. Kleitman, “Matrix tree theorems,” J. Combin. Theory,A24, No. 3, 377–381 (1978).

    Google Scholar 

  5. S. Chaiken, “A combinatorial proof of all minors matrix tree theorem,” SIAM J. Algebr. Discr. Methods,3, No. 3 319–329 (1982).

    Google Scholar 

  6. R. Vohra, and L. Washington, “Counting spanning trees in the graphs of Kleitman and Golden and a generalization,” J. Franklin Inst.,318, No. 5, 349–355 (1984).

    Google Scholar 

  7. G. Baron, H. Prodinger, R. F. Tichy, et al., “The number of spanning trees in the square of a cycle,” Fibonacci Quarterly,23, No. 3, 258–264 (1985).

    Google Scholar 

  8. F. T. Boesch and H. Prodinger, “Spanning tree formulas and Chebyshev polynomials,” Graphs and Combinatorics,2, No. 3, 191–200 (1986).

    Google Scholar 

  9. A. I. Vol'pert, “Elementary proof of the Jordan theorem,” Usp. Mat. Nauk,5, No. 5(39), 168–172 (1950).

    Google Scholar 

  10. A. F. Filippov, “Elementary proof of the Jordan theorem,” Usp. Mat. Nauk,5, No. 5(39), 173–176 (1950)

    Google Scholar 

  11. G.-C. Rota, “Baxter algebras and combinatorial identities, II,” Bull. Am. Math. Soc.,75, No. 2, 330–334 (1969).

    Google Scholar 

  12. N. G. de Bruijn, “Polya's theory of counting,” in: Applied Combinatorial Mathematics [Russian translation], Mir, Moscow (1968), pp. 61–106.

    Google Scholar 

  13. A. Hurwitz, Theory of Analytical and Elliptical Functions [Russian translation], GTTI, Leningrad-Moscow (1933).

    Google Scholar 

  14. V. A. Krechmar, Problems in Algebra [in Russian], Nauka, Moscow (1968).

    Google Scholar 

  15. G. Polya and G. Szego, Problems and Theorems in Analysis, Springer, Berlin (1972).

    Google Scholar 

  16. J. Riordan, An Introduction to Combinatorial Analysis Wiley, New York (1958).

    Google Scholar 

  17. V. L. Goncharov, “Topics in combinatorics,” Izv. Akad. nauk SSSR,8, No. 1, 3–48 (1944).

    Google Scholar 

  18. L. M. Koganov, “Coding and counting spanning trees in Kleitman-Golden graphs,” Proc. Seminar on Discrete Mathematics and Its Applications [in Russian], O. B. Lupanov (ed.), Izd. Mosk. Gos. Univ., Moscow (1989).

    Google Scholar 

Download references

Authors
  1. L. M. Koganov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 1–7, May–June, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koganov, L.M. Coding and counting spanning trees in Kleitman-Golden graphs. Cybern Syst Anal 27, 311–319 (1991). https://doi.org/10.1007/BF01068310

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation