activity
19972015
most citedVertex-transitive CIS graphs

13 citations · 18 across the 7 of their papers we have counts for

collaborators

10 papers

math.CO2015

On Color Preserving Automorphisms of Cayley Graphs of Odd Square-free Order

Edward Dobson, Ademir Hujdurović, Klavdija Kutnar +1

An automorphism of a Cayley graph of a group with connection set is color-preserving if or for every edge $(g,gs)\in E(Cay(G…

math.CO2015

Cayley graphs of more than one abelian group

Edward Dobson, Joy Morris

We show that for certain integers , the problem of whether or not a Cayley digraph of is also isomorphic to a Cayley digraph of some other abelian group of…

math.CO2014★ 13 cited

Vertex-transitive CIS graphs

Edward Dobson, Ademir Hujdurović, Martin Milanič +1

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-co…

math.CO2014

A comment on: "Further restrictions on the structure of finite DCI-groups"

Edward Dobson, Joy Morris, Pablo Spiga

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The cl…

math.CO2013★ 4 cited

Cayley graphs on abelian groups

Edward Dobson, Pablo Spiga, Gabriel Verret

Let be an abelian group and let be the automorphism of defined by . A Cayley graph is said to have an automorphism group \emph{…

math.CO2012★ 1 cited

Asymptotic Automorphism Groups of Circulant Graphs and Digraphs

Soumya Bhoumik, Edward Dobson, Joy Morris

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give so…