activity
20022009
most citedOn generalised Paley graphs and their automorphism groups

6 citations · 15 across the 16 of their papers we have counts for

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO20091 cited

Bipartite divisor graphs for integer subsets

Mohammad A. Iranmanesh, Cheryl E. Praeger

Inspired by connections described in a recent paper by Mark L. Lewis, between the common divisor graph $\Ga(X)$ and the prime vertex graph , for a set of positive integer…

math.CO2009

Strongly regular edge-transitive graphs

Joy Morris, Cheryl E. Praeger, Pablo Spiga

In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family…

math.CO20082 cited

Fundamental Dominations in Graphs

Arash Behzad, Mehdi Behzad, Cheryl E. Praeger

Nine variations of the concept of domination in a simple graph are identified as fundamental domination concepts, and a unified approach is introduced for studying them. For each v…

math.CO20073 cited

Primitive decompositions of Johnson graphs

Alice Devillers, Michael Giudici, Cai Heng Li +1

A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all tr…

math.CO2007

Classification of line-transitive point-imprimitive linear spaces with line size at most 12

Cheryl E. Praeger, Shenglin Zhou

In this paper we complete a classification of finite linear spaces $\cS$ with line size at most 12 admitting a line-transitive point-imprimitive subgroup of automorphisms. The exam…

math.CO20066 cited

On generalised Paley graphs and their automorphism groups

Tian Khoon Lim, Cheryl E. Praeger

The generalised Paley graphs are, as their name suggests, a generalisation of the Paley graphs, first defined by Paley in 1933 (see \cite{Paley}). They arise as the relation graphs…