Premium
On isomorphic factorizations of circulant graphs
Author(s) -
Alspach Brian,
Dyer Danny,
Kreher Donald L.
Publication year - 2006
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20080
Subject(s) - circulant matrix , mathematics , combinatorics , conjecture , circulant graph , graph , discrete mathematics , line graph , voltage graph
We investigate the conjecture that every circulant graph X admits a k ‐isofactorization for every k dividing | E ( X )|. We obtain partial results with an emphasis on small values of k . © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom