Title of article
Large bipartite Cayley graphs of given degree and diameter
Author/Authors
Vetr?k، نويسنده , , Tom?? and Simanjuntak، نويسنده , , Rinovia and Baskoro، نويسنده , , Edy Tri Baskoro، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
3
From page
324
To page
326
Abstract
Let B C d , k be the largest possible number of vertices in a bipartite Cayley graph of degree d and diameter k . We show that B C d , k ≥ 2 ( k − 1 ) ( ( d − 4 ) / 3 ) k − 1 for any d ≥ 6 and any even k ≥ 4 , and B C d , k ≥ ( k − 1 ) ( ( d − 2 ) / 3 ) k − 1 for d ≥ 6 and k ≥ 7 such that k ≡ 3 (mod 4 ).
Keywords
diameter , bipartite graph , Degree , Cayley graph
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1599571
Link To Document