Deriving divisibility theorems with Burnside's theorem.
Evans, Tyler J., Holt, Benjamin V. (2005)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Counting non-isomorphic maximal independent sets of the -cycle graph.”
Deriving divisibility theorems with Burnside's theorem.
On the permutations generated by cyclic shift.
Legendre, Stéphane, Paclet, Philippe (2011)
Journal of Integer Sequences [electronic only]
Similarity:
Universal cyclic relations
Vítězslav Novák (1986)
Archivum Mathematicum
Similarity:
Some properties of unitary Cayley graphs.
Klotz, Walter, Sander, Torsten (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Recognizing circulant graphs of prime order in polynomial time.
Muzychuk, Mikhail, Tinhofer, Gottfried (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Livingstone-Wagner theorem.
Mnukhin, V.B., Siemons, I.J. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A dual approach to triangle sequences: a multidimensional continued fraction algorithm.
Assaf, Sami, Chen, Li-Chung, Cheslack-Postava, Tegan, Cooper, Benjamin, Diesl, Alexander, Garrity, Thomas, Lepinski, Mathew, Schuyle, Adam (2005)
Integers
Similarity:
Symmetry breaking in graphs.
Albertson, Michael O., Collins, Karen L. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity: