Domination alteration sets in graphs
dc.contributor.author | Bauer, Douglas | en_US |
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Nieminen, Juhani | en_US |
dc.contributor.author | Suffel, Charles L. | en_US |
dc.date.accessioned | 2006-04-07T18:48:26Z | |
dc.date.available | 2006-04-07T18:48:26Z | |
dc.date.issued | 1983 | en_US |
dc.identifier.citation | Bauer, Douglas, Harary, Frank, Nieminen, Juhani, Suffel, Charles L. (1983)."Domination alteration sets in graphs." Discrete Mathematics 47(): 153-161. <http://hdl.handle.net/2027.42/25374> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V00-497B741-1/2/f0fc68b5298183741fa58993fa171fd4 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/25374 | |
dc.description.abstract | The domination number [alpha](G) of a graph G is the size of a minimum dominating set, i.e., a set of points with the property that every other point is adjacent to a point of the set. In general [alpha](G) can be made to increase or decrease by the removal of points from G. Our main objective is the study of this phenomenon. For example we show that if T is a tree with at least three points then [alpha](T - v) > [alpha] (T) if and only if [nu] is in every minimum dominating set of T. Removal of a set of lines from a graph G cannot decrease the domination number. We obtain some upper bounds on the size of a minimum set of lines which when removed from G increases the domination number. | en_US |
dc.format.extent | 755557 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Domination alteration sets in graphs | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationother | Stevens Institute of Technology, Hoboken, NJ 07030, USA | en_US |
dc.contributor.affiliationother | University of Oulu, 90570, Oulu 57, Finland | en_US |
dc.contributor.affiliationother | Stevens Institute of Technology, Hoboken, NJ 07030, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/25374/1/0000823.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(83)90085-7 | en_US |
dc.identifier.source | Discrete Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.