Minimum cycle bases for direct products of K2 with complete graphs

Abstract

We construct a minimum cycle basis for the direct product K2 × Kp of two complete graphs where p ≥ 2. For p > 3, these bases consists only of squares. This completes the work of R. Hammack, who treated the case Kp ×Kq for p, q ≥ 3 [Inform. Process. Lett. 102 (2007), 214–218.] 

Topics

1 Figure or Table

Cite this paper

@article{Bradshaw2009MinimumCB, title={Minimum cycle bases for direct products of K2 with complete graphs}, author={Zachary Bradshaw and M. M. M. Jaradat}, journal={Australasian J. Combinatorics}, year={2009}, volume={43}, pages={127-132} }