Premium
Star factorizations of graph products
Author(s) -
Bryant Darryn E.,
ElZanati Saad I.,
Eynden Charles Vanden
Publication year - 2001
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/1097-0118(200102)36:2<59::aid-jgt1>3.0.co;2-a
Subject(s) - mathematics , combinatorics , star (game theory) , cayley graph , vertex transitive graph , graph , discrete mathematics , petersen graph , voltage graph , line graph , mathematical analysis
A k ‐star is the graph K 1, k . We prove a general theorem about k ‐star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k ‐star factorizations of any power (K q ) s of a complete graph with prime power order q , products C r 1 × C r 2 ×··· × C r kof k cycles of arbitrary lengths, and any power ( C r ) s of a cycle of arbitrary length. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 59–66, 2001