From quantum graphs to quantum random walks

We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.Comment: 14 pages, 6 figure

Some colouring problems for Paley graphs

The Paley graph Pq, where q≡1(mod4) is a prime power, is the graph with vertices the elements of the finite field Fq and an edge between x and y if and only if x-y is a non-zero square in Fq. This paper gives new results on some colouring problems for Paley graphs and related discussion. © 2005 Elsevier B.V. All rights reserved