Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"alliance partition"”.
-
Alliance Partitions in Graphs.
… in <em>V</em> is called a <em>defensive alliance</em> if for each <em>v</em> in <em>S</em>, there are at least as many vertices from the closed neighborhood of <em>v</em> in <em>S</em> as in <em>V</em>-<em>S</em>. If there are strictly more vertices from the closed neighborhood of …