Abstract
Let G=Gn(a1,a2) be a connected circulant digraph of order n with two distinct jumps a1,a2
Author supplied keywords
Cite
CITATION STYLE
APA
Bogdanowicz, Z. R. (2015). Decomposition of circulant digraphs with two jumps into cycles of equal lengths. Discrete Applied Mathematics, 180, 45–51. https://doi.org/10.1016/j.dam.2014.08.007
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free