Random Latin square graphs |
| |
| Authors: | Demetres Christofides Klas Markstrom |
| |
| Affiliation: | 1. Institute for Theoretical Computer Science, Faculty of Mathematics and Physics, Malostranské Námêstí 25, 188 00 Prague, Czech RepublicSupported by Engineering and Physical Sciences Research Council, The Cambridge Commonwealth Trust, Department of Mathematics and Mathematical Statistics of Ume? University.;2. Department of Mathematics and Mathematical Statistics, Ume? University, 90187 Ume?, SwedenSupported by The Royal Physiographic Society in Lund. |
| |
| Abstract: | In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their expansion properties as well as their connectivity and Hamiltonicity. The results obtained are compared with other models of random graphs and several similarities and differences are pointed out. For many properties our results for the general case are as strong as the known results for random Cayley graphs and sometimes improve the previously best results for the Cayley case. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011 |
| |
| Keywords: | random graphs Cayley graphs Latin squares |
|
|
