Skip to main content
Log in

Enumeration of labeled geodetic graphs with small cyclomatic number

  • Volume 101, Number 5, May, 2017
  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

Explicit expressions for the numbers of labeled geodetic bicyclic, tricyclic, and tetracyclic graphs with a given number of vertices are obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Harary and E. M. Palmer, Graphical Enumeration (Academic, New York–London, 1973; Mir, Moscow, 1977).

    MATH  Google Scholar 

  2. G. W. Ford and G. E. Uhlenbeck, “Combinatorial problems in the theory of graphs. IV,” Proc. Nat. Acad. Sci. U. S. A. 43, 163–167 (1957).

    Article  MathSciNet  Google Scholar 

  3. J. G. Stemple and M. E. Watkins, “On planar geodetic graphs,” J. Combin. Theory 4, 101–117 (1968).

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Drmota, É. Fusy, M. Kang, V. Kraus, and J. Rue, “Asymptotic study of subcritical graph classes,” SIAM J. DiscreteMath. 25 (4), 1615–1651 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  5. C. E. Frasser, “k-Geodetic graphs and their application to the topological design of computer networks,” Proc. Argentinian Workshop on Theoretical Computer Science, 28 JAIIO-WAIT’99 (1999), pp. 187–203.

    Google Scholar 

  6. V. A. Voblyi, “Enumeration of labeled connected graphs with given numbers of vertices and edges,” Diskretn. Anal. Issled. Oper. 23 (2), 5–20 (2016).

    MathSciNet  MATH  Google Scholar 

  7. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration (Wiley, New York, 1983; Nauka, Moscow, 1990).

    MATH  Google Scholar 

  8. J. Riordan, Combinatorial Identities (Wiley, New York, 1968; Nauka, Moscow, 1982).

    MATH  Google Scholar 

  9. A. P. Prudnikov, Yu. A. Brychkov, and O. I. Marichev, Integrals and Series. Elementary Functions (Nauka, Moscow, 1981) [in Russian].

    MATH  Google Scholar 

  10. V. A. Voblyi, “Enumeration of labeled geodetic planar graphs,” Mat. Zametki 97 (3), 336–341 (2015) [Math. Notes 97 (3–4), 321–325 (2015)].

    Article  MathSciNet  MATH  Google Scholar 

  11. B. R. Heap, “The enumeration of homeomorphically irreducible star graphs,” J. Math. Phys. 7, 1582–1587 (1966).

    Article  MathSciNet  MATH  Google Scholar 

  12. J. G. Stemple, “Geodetic graph homeomorphic to a complete graph,” in CombinatorialMathematics, Ann. New York Acad. Sci. (New York Acad. Sci., New York, 1979), Vol. 319, pp. 512–517.

    Google Scholar 

  13. P. Hic, “Criticality concepts in geodetic graphs,” Math. Slovaca 36 (3), 329–333 (1986).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Voblyi.

Additional information

Original Russian Text © V. A. Voblyi, 2017, published in Matematicheskie Zametki, 2017, Vol. 101, No. 5, pp. 684–689.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Voblyi, V.A. Enumeration of labeled geodetic graphs with small cyclomatic number. Math Notes 101, 790–794 (2017). https://doi.org/10.1134/S0001434617050042

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0001434617050042

Keywords

Navigation