## Abstract 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
On Solvable Groups and Circulant Graphs
β Scribed by Edward Dobson
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 84 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The circulant graphs are of particular interest as models of communication networks. In this work, we present new reliability analysis results for circulants based on the concept of restricted edge connectivity, which generalizes the super-l property of a graph. We evaluate the restricted edge conne
The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi
## Abstract We solve in various spaces the linear equations __L~Ξ±~g__ = __f__ , where __L~Ξ±~__ belongs to a class of transversally elliptic second order differential operators on the Heisenberg group with double characteristics and complexβvalued coefficients, not necessarily locally solvable. (Β© 2