On cycle sequences
From MaRDI portal
For each vertex \(v\) in a graph \(G\), the maximum length of a cycle which passes through \(v\) is called the cycle number of \(v\), denoted by \(c(v)\). A sequence \(a_1,a_2,\dots,a_n\) of nonnegetive integers is called a cycle sequence of a graph \(G\) if the vertices of \(G\) can be labeled as \(v_1,v_2,\dots,v_n\) such that \(a_i=c(v_i)\) for \(1\leq i\leq n\). The authors give necessary and sufficient conditions for a sequence to be a cycle sequence. A polynomial time procedure for recognizing cycle sequences is derived as well.
Recommendations
- scientific article; zbMATH DE number 746090
- On stationary and cycle-stationary sequences
- scientific article; zbMATH DE number 5983737
- Cycles generated by sequential iterations
- scientific article; zbMATH DE number 908566
- scientific article; zbMATH DE number 1504657
- Circulants and Sequences
- scientific article; zbMATH DE number 3277267
- A result about cycles in Ducci sequences
Cited in
(9)- Cycle orders
- Note on cyclic sequences in the product rate variation problem
- scientific article; zbMATH DE number 5983737 (Why is no real title available?)
- Cyclic Inclusion-Exclusion
- scientific article; zbMATH DE number 3985265 (Why is no real title available?)
- A Search for Aliquot Cycles Below 10 10
- On the inducibility of cycles
- On the inducibility of cycles
- Two classes of sequences derived from single cycle T-functions
This page was built for publication: On cycle sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936098)
