Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskie Zametki, 1970, Volume 8, Issue 6, Pages 721–732 (Mi mzm9622)  
The number of strongly connected directed graphs

V. A. Liskovets

Mathematics Institute, Academy of Sciences of the Belorussian SSR
Full-text PDF (1569 kB) English version article
Abstract: Solutions of known problems in the enumeration of graphs are obtained. The number of graphs is expressed, by using a lemma proved by Burnside, in terms of the values of an auxiliary combinatorial function of the partitions of a number. These values, expressing the number of strongly connected graphs having a fixed automorphism of a given cyclic type, are determined by a system of linear recurrence relations.
Received: 03.03.1969
English version:
Mathematical Notes, 1970, Volume 8, Issue 6, Pages 877–882
DOI: https://doi.org/10.1007/BF01673687
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: Russian
Citation: V. A. Liskovets, “The number of strongly connected directed graphs”, Mat. Zametki, 8:6 (1970), 721–732; Math. Notes, 8:6 (1970), 877–882
Citation in format AMSBIB
\Bibitem{Lis70}
\by V.~A.~Liskovets
\paper The number of strongly connected directed graphs
\jour Mat. Zametki
\yr 1970
\vol 8
\issue 6
\pages 721--732
\mathnet{http://mi.mathnet.ru/mzm9622}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=276142}
\zmath{https://zbmath.org/?q=an:0217.31001}
\transl
\jour Math. Notes
\yr 1970
\vol 8
\issue 6
\pages 877--882
\crossref{https://doi.org/10.1007/BF01673687}
Linking options:
  • https://www.mathnet.ru/eng/mzm9622
  • https://www.mathnet.ru/eng/mzm/v8/i6/p721
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:240
    Full-text PDF :108
    References:4
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025