Generating Quartic Graphs

Narjess Afzaly

CS HDR MONITORING Algorithm and Data Group

DATE: 2011-06-01
TIME: 13:30:00 - 13:45:00
LOCATION: CSIT Seminar Room, N101
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
Efficient methods for generation of mathematical structures have use in mathematics and chemistry. Generating quartic graphs or of 4-regular graphs and some of its sub-classes are of our interest. The method we use to generate this class of graphs is called "canonical construction path" in which larger graphs are constructed out of the smaller ones, by some well defined operation, avoiding constructing isomorphism copies. The graphs which can not be constructed out of any other graph in the same class under the defined operation are called irreducible graphs. The main idea is to define a proper operation and find the irreducible graphs. Such an operation and irreducible quartic graphs will be presented as well as our attempt to define a proper operation to generate quartic graphs which contain no 3-cycle and quartic graphs which contain no 3-cycles and no 4-cycles.
BIO:
Narjess is a PhD student in the Algorithm and Data group