Personnel : Department of Mathematics and Statistics : University of Melbourne

Department Homepage

.: Academic Continuing(Teaching & Research)

Back to the Personnel Search

Associate Professor Sanming ZHOU
Position:	Senior Lecturer
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: Selected Publications \| Publications RSS Feed A distance-labelling problem for hypercubes(2008) more Frobenius circulant graphs of valency four(2008) more On a class of finite symmetric graphs(2008) more Large forbidden trade volumes and edge packings of random graphs(2008) more Finite symmetric graphs with 2-arc transitive quotients II(2007) more
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:

Alison THOMSON	"Graph theory problems arising from optical networks"
Guangjun XU	"Cayley graphs, network design and domination"
Ricky ROTHERAM	"Cores in vertex-transitive graphs"

Recent Honours Students:

Subject(s) Currently Teaching:

620-156	Linear Algebra (Semester 2, 2009)
620-615	Network Optimisation (Semester 2, 2009)

Recent Grant History:

Year(s)	Source	Type	Title
2005 - 2007	ARC	Discovery	Channel Assignment in Cellular Communication Systems and Optical Networks
2003 - 2005	ARC	Discovery	Interconnection Network Routing and Graph Symmetry

Committees:

Honours and Masters Committee

Contact the University : Disclaimer & Copyright : Privacy : Accessibility