Abstract

A factoring of a graph G = (V,E) is a collection of spanning subgraphs F1, F2, ?, Fk, known as factors into which the edge set E has been partitioned. A dominating set of a graph is a set of nodes such that every node in the graph is either contained in the set or has an edge to some node in the set. Each factor Fi is itself a graph and so has a dominating set. This set is called a local dominating set or LDS. An LDS of minimum size contains (gamma)i nodes. In addition, there is some set of nodes named a global dominating set which dominates all of the factors. If a global dominating set is of a minimum size, it is called a GDS and contains (gamma) nodes. A central question answered by this dissertation is under what circumstances, given a set of integers (gamma)1, (gamma)2, ..., (gamma)k, and (gamma) there is a graph which can be factored into k factors in such a way that a minimum LDS of Fi has size (gamma)i, 1 < = i < = k, and GDS has size (gamma).

Notes

If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu

Graduation Date

1992

Semester

Fall

Advisor

Brooks, George H.

Degree

Doctor of Philosophy (Ph.D.)

College

College of Arts and Sciences

Department

Computer Science

Degree Program

Computer Science

Format

PDF

Language

English

Rights

Written permission granted by copyright holder to the University of Central Florida Libraries to digitize and distribute for nonprofit, educational purposes.

Length of Campus-only Access

None

Access Status

Doctoral Dissertation (Open Access)

Identifier

DP0001860

Contributor (Linked data)

George H. Brooks (Q57778980)

Download

Share

COinS