Sanming Zhou

Orcid: 0000-0001-9854-6076

According to our database1, Sanming Zhou authored at least 97 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Stability of graph pairs involving vertex-transitive graphs.
Discret. Math., April, 2024

A Solution to Babai's Problems on Digraphs with Non-diagonalizable Adjacency Matrix.
Comb., 2024

2023
Aldous' spectral gap property for normal Cayley graphs on symmetric groups.
Eur. J. Comb., May, 2023

2022
Nontrivial <i>t</i>-Intersecting Families for Vector Spaces.
SIAM J. Discret. Math., September, 2022

A Graph Symmetrization Bound on Channel Information Leakage Under Blowfish Privacy.
IEEE Trans. Inf. Theory, 2022

Corrigendum to "On subgroup perfect codes in Cayley graphs" [European J. Combin. 91 (2021) 103228].
Eur. J. Comb., 2022

Subgroup regular sets in Cayley graphs.
Discret. Math., 2022

Radio labelling of two-branch trees.
CoRR, 2022

Eigenvalues of Cayley Graphs.
Electron. J. Comb., 2022

2021
Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs.
J. Graph Theory, 2021

Stability of graph pairs.
J. Comb. Theory, Ser. B, 2021

An explicit characterization of arc-transitive circulants.
J. Comb. Theory, Ser. B, 2021

On subgroup perfect codes in Cayley graphs.
Eur. J. Comb., 2021

Distance-constrained labellings of Cartesian products of graphs.
Discret. Appl. Math., 2021

Perfect state transfer in NEPS of complete graphs.
Discret. Appl. Math., 2021

Extremal even-cycle-free subgraphs of the complete transposition graphs.
Appl. Math. Comput., 2021

2020
Subgroup Perfect Codes in Cayley Graphs.
SIAM J. Discret. Math., 2020

A Graph Symmetrisation Bound on Channel Information Leakage under Blowfish Privacy.
CoRR, 2020

2019
Stability of circulant graphs.
J. Comb. Theory, Ser. B, 2019

Hadwiger's conjecture for squares of 2-trees.
Eur. J. Comb., 2019

Affine flag graphs and classification of a family of symmetric graphs with complete quotients.
Discret. Math., 2019

The vertex-isoperimetric number of the incidence and non-incidence graphs of unitals.
Des. Codes Cryptogr., 2019

2018
Perfect Codes in Cayley Graphs.
SIAM J. Discret. Math., 2018

Weak metacirculants of odd prime power order.
J. Comb. Theory, Ser. A, 2018

The Isoperimetric Number of the Incidence Graph of PG(n, q).
Electron. J. Comb., 2018

2017
Preface.
J. Interconnect. Networks, 2017

Hadwiger's Conjecture for the Complements of Kneser Graphs.
J. 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.
Discret. Math., 2017

Recursive cubes of rings as models for interconnection networks.
Discret. Appl. Math., 2017

Networking for Big Data: A Survey.
IEEE Commun. Surv. Tutorials, 2017

2016
Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes.
J. Graph Theory, 2016

Total perfect codes in Cayley graphs.
Des. Codes Cryptogr., 2016

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

Hadwiger's Conjecture for 3-Arc Graphs.
Electron. J. Comb., 2016

A Family of Symmetric Graphs with Complete Quotients.
Electron. J. Comb., 2016

Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms.
Ars Math. Contemp., 2016

A linear-time algorithm for the orbit problem over cyclic groups.
Acta Informatica, 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.
Electron. Notes Discret. Math., 2015

Radio number of trees.
Electron. Notes Discret. Math., 2015

Three-arc graphs: Characterization and domination.
Discret. Appl. Math., 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

2014
Unitary Graphs.
J. Graph Theory, 2014

Hamiltonicity of 3-Arc Graphs.
Graphs Comb., 2014

Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes.
Eur. J. Comb., 2014

Rotational circulant graphs.
Discret. Appl. Math., 2014

Linear and cyclic distance-three labellings of trees.
Discret. Appl. Math., 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.
Discret. Appl. Math., 2013

2012
Gossiping and routing in second-kind Frobenius graphs.
Eur. J. Comb., 2012

On 4-valent Frobenius circulant graphs.
Discret. Math. Theor. Comput. Sci., 2012

Spectral Properties of Unitary Cayley Graphs of Finite Commutative Rings.
Electron. J. Comb., 2012

2011
A study of 3-arc graphs.
Discret. Appl. Math., 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.
Discret. Math., 2010

Optimal radio labellings of complete m-ary trees.
Discret. Appl. Math., 2010

2009
A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks.
SIAM J. Discret. Math., 2009

Classification of a family of symmetric graphs with complete 2-arc-transitive quotients.
Discret. Math., 2009

Minimum partition of an independence system into independent sets.
Discret. Optim., 2009

Distance-two labellings of Hamming graphs.
Discret. Appl. Math., 2009

2008
On a class of finite symmetric graphs.
Eur. J. Comb., 2008

Large forbidden trade volumes and edge packings of random graphs.
Discret. Math., 2008

A distance-labelling problem for hypercubes.
Discret. Appl. Math., 2008

2007
Hamiltonicity of random graphs produced by 2-processes.
Random Struct. Algorithms, 2007

Finite symmetric graphs with two-arc transitive quotients II.
J. 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.
Electron. Notes Discret. Math., 2007

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.
Discret. Math., 2007

2006
Fuzzy causal networks: general model, inference, and convergence.
IEEE Trans. Fuzzy Syst., 2006

Dynamic domination in fuzzy causal networks.
IEEE Trans. Fuzzy Syst., 2006

2005
Labelling Cayley Graphs on Abelian Groups.
SIAM J. Discret. 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 Process. Lett., 2004

Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.
J. Interconnect. Networks, 2004

A Gallai-type equality for the total domination number of a graph.
Discuss. Math. Graph Theory, 2004

Almost Covers Of 2-Arc Transitive Graphs.
Comb., 2004

2003
Quotient FCMs-a decomposition theory for fuzzy cognitive maps.
IEEE Trans. Fuzzy Syst., 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.
Discret. Math., 2002

An inequality between the diameter and the inverse dual degree of a tree.
Discret. Math., 2002

Finite locally-quasiprimitive graphs.
Discret. Math., 2002

2001
On Isomorphisms of Minimal Cayley Graphs and Digraphs.
Graphs Comb., 2001

2000
Bounding the bandwidths for graphs.
Theor. Comput. Sci., 2000

1999
A sequential coloring algorithm for finite sets.
Discret. Math., 1999

Domination number and neighbourhood conditions.
Discret. Math., 1999

1998
Harper-type lower bounds and the bandwidths of the compositions of graphs.
Discret. Math., 1998

Interpolation theorems for graphs, hypergraphs and matroids.
Discret. Math., 1998

Upper bounds for f-domination number of graphs<sup>, </sup>.
Discret. Math., 1998

1995
Matroid tree graphs and interpolation theorems.
Discret. Math., 1995

1993
Disjoint Hamiltonian cycles in fan 2<i>k</i>-type graphs.
J. Graph Theory, 1993


  Loading...