Alliance Partitions in Graphs.
For a graph G=(V,E), a nonempty subset S contained in V is called a defensive alliance if for each v in S, there are at least as many vertices from the closed neighborhood of v in S as in V-S. If there are strictly more vertices from the closed neighborhood of v in S as in V-S, then S is a strong de...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2007
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/2080 https://dc.etsu.edu/cgi/viewcontent.cgi?article=3441&context=etd |