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 3 of 3 for “"defensive alliances"”.
-
Alliance Partitions in Graphs.
… contained 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 …
-
Analyzing The Community Structure Of Web-like Networks: Models And Algorithms
… density of certain small subgraphs--such as defensive alliances on three and four nodes--in various random graphs models. Our findings show that while in the binomial random graph the expected density of such subgraphs is very close to zero, in some dynamic random graph models it is much …
-
Partitioning A Graph In Alliances And Its Application To Data Clustering
… of the formation of these subgroups that we call alliances differ in different situations, such as, kinship and friendship (in the case of individuals), common economic interests (for both individuals and states), common political interests, and geographical proximity. This structure of alliances …