Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






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


Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2016, Volume 13, Pages 286–299
DOI: https://doi.org/10.17377/semi.2016.13.023
(Mi semr672)
 

Discrete mathematics and mathematical cybernetics

The number of small cycles in the Star graph

Alexey N. Medvedevabc

a Sobolev Institute of Mathematics, 4, Koptyug av., 630090, Novosibirsk, Russia
b MTA Rényi Alfréd Institute of Mathematics, Reáltanoda ut. 13-15., Budapest, 1053, Hungary
c Central European University, Nador ut. 9, Budapest, 1051, Hungary
References:
Abstract: The Star graph is the Cayley graph on the symmetric group $Sym_n$ generated by the set of transpositions $\{(1\,i) \in Sym_n: 2 \leqslant i \leqslant n\}$. This graph is bipartite and does not contain odd cycles but contains all even cycles with a sole exception of $4$-cycles. We denote as $(\pi,id)$-cycles the cycles constructed from two shortest paths between a given vertex $\pi$ and the identity $id$. In this paper we derive the exact number of $(\pi,id)$-cycles for particular structures of the vertex $\pi$. We use these results to obtain the total number of $10$-cycles passing through any given vertex in the Star graph.
Keywords: Cayley graphs; Star graph; cycle embedding; number of cycles.
Funding agency Grant number
Russian Foundation for Basic Research 15-01-05867_а
Supported by Grant 15–01–05867 of the Russian Foundation of Basic Research.
Received January 21, 2016, published April 29, 2016
Bibliographic databases:
Document Type: Article
UDC: 519.1
MSC: 05C25
Language: English
Citation: Alexey N. Medvedev, “The number of small cycles in the Star graph”, Sib. Èlektron. Mat. Izv., 13 (2016), 286–299
Citation in format AMSBIB
\Bibitem{Med16}
\by Alexey~N.~Medvedev
\paper The number of small cycles in the Star graph
\jour Sib. \`Elektron. Mat. Izv.
\yr 2016
\vol 13
\pages 286--299
\mathnet{http://mi.mathnet.ru/semr672}
\crossref{https://doi.org/10.17377/semi.2016.13.023}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000407781100023}
Linking options:
  • https://www.mathnet.ru/eng/semr672
  • https://www.mathnet.ru/eng/semr/v13/p286
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:218
    Full-text PDF :65
    References:32
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024