# Sanming Zhou

According to our database

^{1}, Sanming Zhou## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Perfect Codes in Cayley Graphs.

SIAM J. Discrete Math., 2018

Weak metacirculants of odd prime power order.

J. Comb. Theory, Ser. A, 2018

2017

Preface.

Journal of Interconnection Networks, 2017

Hadwiger's Conjecture for the Complements of Kneser Graphs.

Journal of Graph Theory, 2017

Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks.

J. Comb. Theory, Ser. A, 2017

Perfect codes in circulant graphs.

Discrete Mathematics, 2017

Recursive cubes of rings as models for interconnection networks.

Discrete Applied Mathematics, 2017

Radio number of trees.

Discrete Applied Mathematics, 2017

Networking for Big Data: A Survey.

IEEE Communications Surveys and Tutorials, 2017

2016

Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes.

Journal of Graph Theory, 2016

Total perfect codes in Cayley graphs.

Des. Codes Cryptography, 2016

An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs.

CoRR, 2016

Hadwiger's Conjecture for 3-Arc Graphs.

Electr. J. Comb., 2016

A Family of Symmetric Graphs with Complete Quotients.

Electr. J. Comb., 2016

A linear-time algorithm for the orbit problem over cyclic groups.

Acta Inf., 2016

Hadwiger's Conjecture and Squares of Chordal Graphs.

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Forwarding and optical indices of 4-regular circulant networks.

J. Discrete Algorithms, 2015

Group distance magic and antimagic graphs.

Electronic Notes in Discrete Mathematics, 2015

Radio number of trees.

Electronic Notes in Discrete Mathematics, 2015

Three-arc graphs: Characterization and domination.

Discrete Applied Mathematics, 2015

A Survey on Approximation Mechanism Design without Money for Facility Games.

CoRR, 2015

Recursive cube of rings.

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Linear and cyclic distance-three labellings of trees.

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Unitary Graphs.

Journal of Graph Theory, 2014

Hamiltonicity of 3-Arc Graphs.

Graphs and Combinatorics, 2014

Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes.

Eur. J. Comb., 2014

Rotational circulant graphs.

Discrete Applied Mathematics, 2014

Linear and cyclic distance-three labellings of trees.

Discrete Applied Mathematics, 2014

A linear time algorithm for the orbit problem over cyclic groups.

CoRR, 2014

A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups.

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups.

J. Comb. Optim., 2013

Labeling outerplanar graphs with maximum degree three.

Discrete Applied Mathematics, 2013

2012

Gossiping and routing in second-kind Frobenius graphs.

Eur. J. Comb., 2012

On 4-valent Frobenius circulant graphs.

Discrete Mathematics & Theoretical Computer Science, 2012

Spectral Properties of Unitary Cayley Graphs of Finite Commutative Rings.

Electr. J. Comb., 2012

2011

A study of 3-arc graphs.

Discrete Applied Mathematics, 2011

2010

Gossiping and routing in undirected triple-loop networks.

Networks, 2010

Imprimitive symmetric graphs with cyclic blocks.

Eur. J. Comb., 2010

The L(h, 1, 1)-labelling problem for trees.

Eur. J. Comb., 2010

Diameter and connectivity of 3-arc graphs.

Discrete Mathematics, 2010

Optimal radio labellings of complete m-ary trees.

Discrete Applied Mathematics, 2010

2009

A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks.

SIAM J. Discrete Math., 2009

Classification of a family of symmetric graphs with complete 2-arc-transitive quotients.

Discrete Mathematics, 2009

Minimum partition of an independence system into independent sets.

Discrete Optimization, 2009

Distance-two labellings of Hamming graphs.

Discrete Applied Mathematics, 2009

2008

On a class of finite symmetric graphs.

Eur. J. Comb., 2008

Large forbidden trade volumes and edge packings of random graphs.

Discrete Mathematics, 2008

A distance-labelling problem for hypercubes.

Discrete Applied Mathematics, 2008

2007

Hamiltonicity of random graphs produced by 2-processes.

Random Struct. Algorithms, 2007

Finite symmetric graphs with two-arc transitive quotients II.

Journal of Graph Theory, 2007

Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem.

J. Discrete Algorithms, 2007

Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey.

Electronic Notes in Discrete Mathematics, 2007

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.

Discrete Mathematics, 2007

Almost covers of 2-arc transitive graphs.

Combinatorica, 2007

2006

Fuzzy causal networks: general model, inference, and convergence.

IEEE Trans. Fuzzy Systems, 2006

Dynamic domination in fuzzy causal networks.

IEEE Trans. Fuzzy Systems, 2006

2005

Labelling Cayley Graphs on Abelian Groups.

SIAM J. Discrete Math., 2005

Finite symmetric graphs with two-arc transitive quotients.

J. Comb. Theory, Ser. B, 2005

2004

A channel assignment problem for optical networks modelled by Cayley graphs.

Theor. Comput. Sci., 2004

Routing balanced communications on hamilton decomposable networks.

Parallel Processing Letters, 2004

Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.

Journal of Interconnection Networks, 2004

A Gallai-type equality for the total domination number of a graph.

Discussiones Mathematicae Graph Theory, 2004

Almost Covers Of 2-Arc Transitive Graphs.

Combinatorica, 2004

2003

Quotient FCMs-a decomposition theory for fuzzy cognitive maps.

IEEE Trans. Fuzzy Systems, 2003

2002

Decycling numbers of random regular graphs.

Random Struct. Algorithms, 2002

Constructing a Class of Symmetric Graphs.

Eur. J. Comb., 2002

Imprimitive symmetric graphs, 3-arc graphs and 1-designs.

Discrete Mathematics, 2002

An inequality between the diameter and the inverse dual degree of a tree.

Discrete Mathematics, 2002

Finite locally-quasiprimitive graphs.

Discrete Mathematics, 2002

2001

On Isomorphisms of Minimal Cayley Graphs and Digraphs.

Graphs and Combinatorics, 2001

2000

Bounding the bandwidths for graphs.

Theor. Comput. Sci., 2000

1999

A sequential coloring algorithm for finite sets.

Discrete Mathematics, 1999

Domination number and neighbourhood conditions.

Discrete Mathematics, 1999

1998

Harper-type lower bounds and the bandwidths of the compositions of graphs.

Discrete Mathematics, 1998

Interpolation theorems for graphs, hypergraphs and matroids.

Discrete Mathematics, 1998

Upper bounds for f-domination number of graphs

^{, }.
Discrete Mathematics, 1998

1995

Matroid tree graphs and interpolation theorems.

Discrete Mathematics, 1995

1993

Disjoint Hamiltonian cycles in fan 2

*k*-type graphs.
Journal of Graph Theory, 1993