Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika. Supplement, 2016, Issue 9, Pages 109–110
DOI: https://doi.org/10.17223/2226308X/9/42 (Mi pdma301) 		 
Applied Theory of Automata and Graphs

Enumeration of labelled flower wheel graphs

V. A. Voblyi, A. K. Meleshko

Bauman Moscow State Technical University, Moscow
Full-text PDF (501 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/9/42
Abstract: The exact formula is obtained for the number of labelled flower wheel graphs with the given numbers of vertices and petals.
Keywords: rooted graph, wheel graph, flower wheel graph.
Document Type: Article
UDC: 519.175.3
Language: Russian
Citation: V. A. Voblyi, A. K. Meleshko, “Enumeration of labelled flower wheel graphs”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 109–110
Citation in format AMSBIB
\Bibitem{VobMel16}
\by V.~A.~Voblyi, A.~K.~Meleshko
\paper Enumeration of labelled flower wheel graphs
\jour Prikl. Diskr. Mat. Suppl.
\yr 2016
\issue 9
\pages 109--110
\mathnet{http://mi.mathnet.ru/pdma301}
\crossref{https://doi.org/10.17223/2226308X/9/42}
Linking options:
  • https://www.mathnet.ru/eng/pdma301
  • https://www.mathnet.ru/eng/pdma/y2016/i9/p109
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025