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, 2018, Volume 103, Issue 5, Pages 657–666
DOI: https://doi.org/10.4213/mzm11492
(Mi mzm11492)
 

This article is cited in 5 scientific papers (total in 5 papers)

The Number of Labeled Outerplanar $k$-Cyclic Graphs

V. A. Voblyi

All-Russian Institute for Scientific and Technical Information of Russian Academy of Sciences
Full-text PDF (427 kB) Citations (5)
References:
Abstract: A $k$-cyclic graph is a graph with cyclomatic number $k$. An explicit formula for the number of labeled connected outerplanar $k$-cyclic graphs with a given number of vertices is obtained. In addition, such graphs with fixed cyclomatic number $k$ and a large number of vertices are asymptotically enumerated. As a consequence, it is found that, for fixed $k$, almost all labeled connected outerplanar $k$-cyclic graphs with a large number of vertices are cacti.
Keywords: enumeration, labeled graph, connected graph, $k$-cyclic graph, outerplanar graph, cactus, asymptotics.
Received: 12.12.2016
Revised: 02.02.2017
English version:
Mathematical Notes, 2018, Volume 103, Issue 5, Pages 694–702
DOI: https://doi.org/10.1134/S0001434618050024
Bibliographic databases:
Document Type: Article
UDC: 519.175.3
Language: Russian
Citation: V. A. Voblyi, “The Number of Labeled Outerplanar $k$-Cyclic Graphs”, Mat. Zametki, 103:5 (2018), 657–666; Math. Notes, 103:5 (2018), 694–702
Citation in format AMSBIB
\Bibitem{Vob18}
\by V.~A.~Voblyi
\paper The Number of Labeled Outerplanar $k$-Cyclic Graphs
\jour Mat. Zametki
\yr 2018
\vol 103
\issue 5
\pages 657--666
\mathnet{http://mi.mathnet.ru/mzm11492}
\crossref{https://doi.org/10.4213/mzm11492}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3795114}
\elib{https://elibrary.ru/item.asp?id=32823042}
\transl
\jour Math. Notes
\yr 2018
\vol 103
\issue 5
\pages 694--702
\crossref{https://doi.org/10.1134/S0001434618050024}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000436583800002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85049133210}
Linking options:
  • https://www.mathnet.ru/eng/mzm11492
  • https://doi.org/10.4213/mzm11492
  • https://www.mathnet.ru/eng/mzm/v103/i5/p657
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:302
    Full-text PDF :32
    References:37
    First page:15
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024