| dc.contributor.author | Fitzpatrick, Shannon Lesley. | en_US |
| dc.date.accessioned | 2014-10-21T12:35:28Z | |
| dc.date.available | 1997 | |
| dc.date.issued | 1997 | en_US |
| dc.identifier.other | AAINQ24738 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10222/55474 | |
| dc.description | We continue the study of paired-domination, introduced by Haynes & Slater (27), and initiate the study of the related topic of paired-irredundance. In particular, we obtain results regarding paired-domination and paired-irredundance in products of graphs; characterize all well paired-dominated graphs of girth at least eight; and characterize all graphs of girth at least seven in which there is a minimum paired-dominating set which induces a maximal matching. | en_US |
| dc.description | Our attention then turns toward dynamic domination. We study the game of Cops and Robber and introduce two variations of that game: the precinct game and the dragnet game. For both games we find upper bounds on the number of cops required to win the game, and for the precinct game, we find exactly the minimum number of cops required to win in such graphs as trees and grids. Finally, we examine isometric embeddings of graphs, and the relationship between the strong isometric dimension of a graph and the minimum number of cops required to win the game of cops and robber. | en_US |
| dc.description | Thesis (Ph.D.)--Dalhousie University (Canada), 1997. | en_US |
| dc.language | eng | en_US |
| dc.publisher | Dalhousie University | en_US |
| dc.publisher | | en_US |
| dc.subject | Mathematics. | en_US |
| dc.title | Aspects of domination and dynamic domination. | en_US |
| dc.type | text | en_US |
| dc.contributor.degree | Ph.D. | en_US |
