Keywords

Graph theory

Abstract

Defensive alliances are a way of using graphs to model the defense of resources (people, buildings, countries, etc.) against attacks where the number of potential attackers against each resource is known. The initial study of defensive alliances focused on questions of minimal defensive alliances in a graph and the minimum possible size of a defensive alliance in a graph, but in order to apply defensive alliances in modeling real-world situations, additional considerations are important. In particular, since each vertex in a defensive alliance represents some real-world object that has a cost associated with remaining in the defensive alliance, it is important to consider the value each vertex adds to the defensive alliance. In this thesis we consider a method of assessing the efficiency of a defensive alliance, including the special case of secure sets.

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

2011

Semester

Summer

Advisor

Zhao, Yue

Degree

Master of Science (M.S.)

College

College of Sciences

Department

Mathematics

Format

application/pdf

Identifier

CFE0004010

URL

http://purl.fcla.edu/fcla/etd/CFE0004010

Language

English

Length of Campus-only Access

None

Access Status

Masters Thesis (Open Access)

Subjects

Dissertations, Academic -- Sciences, Sciences -- Dissertations, Academic

Download

Included in

Mathematics Commons

Share

COinS