On the Unique Tree Representation of Graphs

<p>This dissertation investigates classes of graphs which admit tree representations unique up to isomorphism. The definitions of these classes are based on local properties of P₄'s, A template structure theorem is given which illustrates the nature of the local properties. The template theorem is instantiated for three different classes of graphs. Properties specific to each of the classes are used to produce a tree representation which can be used for graph computations, such as efficient resolution of graph isomorphism. Linear time algorithms for the recognition of three classes of graphs and for the construction of their tree representations are presented. The recognition algorithm also produces, as a by-product, a data structure which can be used for solving the four classic graph optimization problems in linear time.</p>

Name thesis:degree_name

Doctor of Philosophy (PhD)

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Year dc:date.available

1989

Author dc:creator

• Jamison, Beverly

Contributors dc:contributor

• Stephan Olariu
• Kurt Maly
• John Tweed

• Graphs
• Graph classification
• Isomorphism
• Computer Sciences

Statement dc:rights

• <p>In Copyright. URI: <a href="http://rightsstatements.org/vocab/InC/1.0/">http://rightsstatements.org/vocab/InC/1.0/</a> This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</p>

Repository record dc:identifier

https://digitalcommons.odu.edu/computerscience_etds/112

OAI identifier oai:identifier

oai:digitalcommons.odu.edu:computerscience_etds-1108