Professor Sanming ZHOU


School of Mathematics and Statistics

  • Room: 150
  • Building: Peter Hall Building
  • Campus: Parkville Campus

Research Interests

  • Algebraic Graph Theory
  • Graph Structure and Dynamics
  • Random Graph Processes
  • Network Optimisation
  • Algebraic Combinatorics
  • Operations Research

Research Groups

Recent Publications

  • S. Zhou. Weak metacirculants of odd prime power order. Journal of Combinatorial Theory. Series A, 155, 225-243, 2018. doi: 10.1016/j.jcta.2017.11.007.

  • Teng Fang, Binzhou Xia, S. Zhou. Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks. Journal of Combinatorial Theory Series A, 152, 303-340, 2017. doi: 10.1016/j.jcta.2017.06.007.

  • H. Mokhtar, S. Zhou. Recursive cubes of rings as models for interconnection networks. Discrete Applied Mathematics, 217, 639-662, 2017. doi: 10.1016/j.dam.2016.09.026.

  • Shui Yu, Meng Liu, Wanchun Dou, S. Zhou. Networking for Big Data: A Survey. IEEE Communications Surveys and Tutorials, 19, 531-549, 2017. doi: 10.1109/COMST.2016.2610963.

  • Rongquan Feng, He Huang, S. Zhou. Perfect codes in circulant graphs. Discrete Mathematics, 340, 1522-1527, 2017. doi: 10.1016/j.disc.2017.02.007.

View all

Extra Information

My research interest lies in (1) Network Optimization, (2) Algebraic Combinatorics, and (3) Random Graph Processes, which are very active areas in the broad subject of Discrete Mathematics. In (1) I have been working on some network optimisation problems arising from Theoretical Computer Science, Interconnection Networks and Telecommunication. These include the routing, optimal labelling, graph layout, channel assignment, domination and colouring problems. In (2) I have been studying the structure of those graphs which are symmetric with respect to vertices or/and arcs, where an arc is an edge with direction. Roughly speaking, in an arc-symmetric (a vertex-symmetric) graph all arcs (vertices) have the "same" position in the graph. My work in this area involves Permutation Group Theory, Finite Geometry, Design Theory and Regular Maps on surfaces. Intuitively, a random graph process is a process of "growing up" graphs according to some stochastic rule. My research in (3) is focused on some random graph processes which arise from the design and analysis of some randomized algorithms and from simulating the evolution of the Internet and other complex real-world networks.

Current Postgraduate Supervision

Name Thesis title
Patrick ANDERSEN "Coverage and connectivity in wireless sensor networks"
Muhammad Adib SURANI "The Isoperimetric Problem in Block Designs"

Past Postgraduate Supervision

Name Thesis title
Daniel HARVEY "An investigation into graph minors"
Xiaogang LIU "Spectral Characterisation of Graphs"
Hamid MOKHTAR "Routing and wavelength assignment in communication networks"
Michael PAYNE "Problems in geometric graph theory"
Ricky ROTHERAM "Cayley Graphs and network optimization."
Alison THOMSON "Graph theory problems arising from optical networks"
Guangjun XU "Cayley graphs, network design and domination"
Zuhe ZHANG "Analysis of networks: privacy in Bayesian networks and problems in lattice models"

Current MSc Students

Name Project title

Past MSc Students

Name Project title
Yang LI
Muhammad Adib SURANI
Victoria WYATT

Recent Grant History

Year(s) Source Type Title
2012 - 2014 ARC Discovery Hadwiger's graph colouring conjecture
2011 - 2015 ARC Future Fellow Expander graphs, isoperimetric numbers, and forwarding indices


  • Discrete Structures and Algorithms Seminar Coordinator
  • Science International Advisory Committee (SIAC)


  • Faculty International Advancement Committee
  • Recruitment and Publicity Committee
  • Strategic Planning Committee