The number of small cycles in the star graph

Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs


The Star graph is the Cayley graph on the symmetric group Symn generated by the set of transpositions ((1 i) ε Symn: 2 ≤ i ≤ 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 (π, id)-cycles the cycles constructed from two shortest paths between a given vertex π and the identity id. In this paper we derive the exact number of (π, id)- cycles for particular structures of the vertex π. We use these results to obtain the total number of 10-cycles passing through any given vertex in the Star graph.

langue originaleAnglais
Pages (de - à)286-299
Nombre de pages14
journalSiberian Electronic Mathematical Reports
Numéro de publication1
Les DOIs
Etat de la publicationPublié - 1 janv. 2016
Modification externeOui

Empreinte digitale

Examiner les sujets de recherche de « The number of small cycles in the star graph ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation