21 citations · 50 across the 14 of their papers we have counts for
14 papers
Affine flag graphs and classification of a family of symmetric graphs with complete quotients
Yu Qing Chen, Teng Fang, Sanming Zhou
A graph is -symmetric if is a group of automorphisms of which is transitive on the set of ordered pairs of adjacent vertices of . If admits a nontrivial $G…
Weak metacirculants of odd prime power order
Jin-Xin Zhou, Sanming Zhou
Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it ha…
Recursive cubes of rings as models for interconnection networks
Hamid Mokhtar, Sanming Zhou
We study recursive cubes of rings as models for interconnection networks. We first redefine each of them as a Cayley graph on the semidirect product of an elementary abelian group…
Unitary graphs and classification of a family of symmetric graphs with complete quotients
Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco +1
A finite graph is called -symmetric if is a group of automorphisms of which is transitive on the set of ordered pairs of adjacent vertices of . We study a family…
Hadwiger's conjecture for the complements of Kneser graphs
Guangjun Xu, Sanming Zhou
Hadwiger's conjecture asserts that every graph with chromatic number contains a complete minor of order . Given integers , the Kneser graph is th…
Cyclotomic graphs and perfect codes
Sanming Zhou
We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of , with connection sets $\{\pm (ζ_m^i + A):…
A linear time algorithm for the orbit problem over cyclic groups
Anthony Widjaja Lin, Sanming Zhou
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented…
Forwarding and optical indices of 4-regular circulant networks
Heng-Soon Gan, Hamid Mokhtar, Sanming Zhou
An all-to-all routing in a graph is a set of oriented paths of , with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing …
Three-arc graphs: characterization and domination
Guangjun Xu, Sanming Zhou
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple of vertices such that both and are paths of length two. The 3-arc graph of a graph $G…
A note on the degree-diameter problem for arc-transitive graphs
Sanming Zhou
We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.
Hadwiger's conjecture for 3-arc graphs
David R. Wood, Guangjun Xu, Sanming Zhou
The 3-arc graph of a digraph is defined to have vertices the arcs of such that two arcs are adjacent if and only if and are distinct arcs of with $v\…
Rotational circulant graphs
Alison Thomson, Sanming Zhou
A Frobenius group is a transitive permutation group which is not regular but only the identity element can fix two points. Such a group can be expressed as the semi-direct product…
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
Alison Thomson, Sanming Zhou
A Frobenius group is a transitive but not regular permutation group such that only the identity element can fix two points. A finite Frobenius group can be expressed as $G = K \rti…
Hamiltonicity of 3-arc graphs
Guangjun Xu, Sanming Zhou
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple of vertices such that both and are paths of length two. The 3-arc graph of a graph $G…