Title: Department of Computer Science Seminar
Date: Thursday, November 13, 2003
Time: 3:00 pm to 4:00pm
Venue: Room N101, CSIT Building [108]
       
Speaker:  Suresh M. Hegde

Title:  Applications of Graph Labelings
       

Abstract:

Graph labelings, where the vertices and edges are assigned, real
values or subsets of a set subject to certain conditions, have often
been motivated by their utility to various applied fields and their
intrinsic mathematical interest.  Graph labelings were first
introduced in the mid sixties. In the intervening years, dozens of
graph labeling techniques have been studied in over 600 papers. An
enormous body of literature has grown around the subject and is still
getting embellished due to the increasing number of application driven
concepts.

Labeled graphs are becoming an increasingly useful family of
Mathematical Models for a broad range of applications.  While the
qualitative labelings of graph elements have inspired research in
diverse fields such as conflict resolution in social psychology,
electrical circuit theory and energy crisis, quantitative labelings of
graphs have led to quite intricate fields of application such as
coding theory problems, including the design of good radar location
codes, synch-set codes; missile guidance codes and convolution codes
with optimal autocorrelation properties.  Labeled graphs have also
been applied in determining ambiguities in X-ray crystallographic
analysis, to design communication network addressing systems, in
determining optimal circuit layouts and radio-astronomy, etc.

In this talk we discuss some of these applications in detail.


Biography:

Suresh is visiting from the Dept.  of Mathematical and Computational
Sciences National Institute of Technology Karnataka Suathkal,
Srinivasnagar-575025, India. 

URL: 


Further Information: contact Ian Wanless, Ian.Wanless[at]cs.anu.edu.au

URL: http://cs.anu.edu.au/lib/seminars/seminars03/dept20031113b