Change search
ReferencesLink to record
Permanent link

Direct link
Random Latin square graphs
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2012 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 41, no 1, 47-65 p.Article in journal (Refereed) Published
Abstract [en]

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. (C) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011

Place, publisher, year, edition, pages
2012. Vol. 41, no 1, 47-65 p.
National Category
URN: urn:nbn:se:umu:diva-56965DOI: 10.1002/rsa.20390ISI: 000305074500003OAI: diva2:539495
Available from: 2012-07-04 Created: 2012-07-02 Last updated: 2012-07-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Markström, Klas
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
Random structures & algorithms (Print)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 74 hits
ReferencesLink to record
Permanent link

Direct link