Associate Professor Sanming ZHOU

Position: ARC Future Fellow
Email: S.Zhou@ms.unimelb.edu.au
Room: 146
Ext. Number: 43453
Webpage: www.ms.unimelb.edu.au/~smzhou/
Research Group:- Discrete Mathematics & Algebraic Combinatorics
- Operations Research
Interests: - Algebraic Combinatorics
- Graph Structure and Dynamics
- Graph Theory
- Network Optimisation
- Operations Research
- Random Graph Processes

Recent Publications:

  • Labeling outerplanar graphs with maximum degree three (2013) more
  • The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups (2013) more
  • Gossiping and routing in second-kind Frobenius graphs (2012) more
  • On 4-valent Frobenius circulant graphs (2012) more
  • Spectral properties of unitary Cayley graphs of finite commutative rings (2012) more

All Selected Publications

RSS Feed
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:

Daniel HARVEY "An investigation into graph minors"
Xiaogang LIU "Spectral Characterisation of Graphs"
Hamid MOKHTAR "Routing and wavelength assignment in communication networks"
Michael Stuart PAYNE "Problems in geometric graph theory"
Zuhe ZHANG "Entropy Constants of Lattices on Plane, Cylinder and Torus"

Past Postgraduate Supervision:

Alison THOMSON "Graph theory problems arising from optical networks"
Guangjun XU "Cayley graphs, network design and domination"

Past Honours/PGD/Masters(RT) Students:

Robin LANGER
Yang LI
Pongphat TAPTAGAPORN
Victoria WYATT
Muhammad Adib SURANI

Recent Grant History:

Year(s) Source Type Title
2011 - 2015 ARC Future Fellow Expander graphs, isoperimetric numbers, and forwarding indices
2012 - 2014 ARC Discovery Hadwiger's graph colouring conjecture
2005 - 2007 ARC Discovery Channel Assignment in Cellular Communication Systems and Optical Networks
2003 - 2005 ARC Discovery Interconnection Network Routing and Graph Symmetry

Responsibilities:

Course Coordinator - Master of Operations Research and Management Science
Discrete Structures and Algorithms Seminar Coordinator

Committees:

Masters Committee (MORMSc Coordinator)