Title of article :
Resolvable even cycle decompositions of the tensor product of complete graphs
Author/Authors :
Paulraja، نويسنده , , P. and Sampath Kumar، نويسنده , , S.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Pages :
10
From page :
1841
To page :
1850
Abstract :
In this paper, we consider resolvable k -cycle decompositions (for short,  k -RCD) of K m × K n , where × denotes the tensor product of graphs. It has been proved that the standard necessary conditions for the existence of a k -RCD of K m × K n are sufficient when k is even.
Keywords :
Tensor product , Resolvable cycle decomposition
Journal title :
Discrete Mathematics
Serial Year :
2011
Journal title :
Discrete Mathematics
Record number :
1599689
Link To Document :
بازگشت