Candidate: Varaporn Saenpholphat

Degree of: Doctor of Philosophy

Department: Mathematics

Title: Resolvability in Graphs

Committee:
Dr. Ping Zhang, Chair
Dr. Gary Chartrand
Dr. Dr. Allen Schwenk
Dr. Arthur White
Dr. Donald Vanderjagt

Date: Thursday, April 11, 2002 4:00 p.m. - 6:00 p.m.
Alavi Commons Room, 6th Floor, Everett Tower

Abstract:
My research is the area of graph theory. In my dissertation, I study resolvability in graphs, including resolving sets, resolving partitions, and resolving decompositions of graphs. This topic emanates from a fundamental problem in chemistry, which concerns representing a set of chemical compounds in such a way that distinct compounds have distinct representations. A graph-theoretic interpretation of this problem is to provide representations for the vertices (or edges) of a graph in such a way that distinct vertices (or edges) have distinct representations. I approach this study by means of distance in graphs.

Related Topics

Main List of Archives:
Dissertation Defenses

Current Dissertation Defenses