activity
20032009
most citedThe Brown-Colbourn conjecture on zeros of reliability polynomials is false

32 citations · 45 across the 8 of their papers we have counts for

collaborators
Showing 2005 · math.COShow all

3 papers · 2 filters

math.CO2005

Planar triangulations with real chromatic roots arbitrarily close to four

Gordon F. Royle

We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.

math.CO2005★ 1 cited

Colouring Lines in Projective Space

Ameera Chowdhury, Chris Godsil, Gordon Royle

Let be a vector space of dimension over a field of order . The -Kneser graph has the -dimensional subspaces of as its vertices, where two subspaces and …

math.CO2005★ 1 cited

Symmetric Squares of Graphs

Koenraad Audenaert, Chris Godsil, Gordon Royle +1

We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also prov…