You are here

Global domination of factors of a graph

Download pdf | Full Screen View

Date Issued:
1992
Abstract/Description:
University of Central Florida College of Arts and Sciences Thesis; 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 minimumsize 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 circummstances, 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 [less than or equal to] i [less than or equal to] k, and GDS has size (gamma).
Title: Global domination of factors of a graph.
0 views
0 downloads
Name(s): Carrington, Julie R., Author
Brigham, Robert C., Committee Chair
Arts and Sciences, Degree Grantor
Type of Resource: text
Date Issued: 1992
Publisher: University of Central Florida
Language(s): English
Abstract/Description: University of Central Florida College of Arts and Sciences Thesis; 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 minimumsize 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 circummstances, 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 [less than or equal to] i [less than or equal to] k, and GDS has size (gamma).
Identifier: CFR0001860 (IID), ucf:52916 (fedora)
Note(s): 1992-12-01
Ph.D.
Computer Science
Doctorate
This record was generated from author submitted information.
Electronically reproduced by the University of Central Florida from a book held in the John C. Hitt Library at the University of Central Florida, Orlando.
Subject(s): Arts and Sciences -- Dissertations
Academic
Dissertations
Academic -- Arts and Sciences
Persistent Link to This Record: http://purl.flvc.org/ucf/fd/CFR0001860
Restrictions on Access: public
Host Institution: UCF

In Collections