• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Powerful Alliances in Graphs

Brigham, Robert C., Dutton, Ronald D., Haynes, Teresa W., Hedetniemi, Stephen T. 28 April 2009 (has links)
For a graph G = (V, E), a non-empty set S ⊆ V is a defensive alliance if for every vertex v in S, v has at most one more neighbor in V - S than it has in S, and S is an offensive alliance if for every v ∈ V - S that has a neighbor in S, v has more neighbors in S than in V - S. A powerful alliance is both defensive and offensive. We initiate the study of powerful alliances in graphs.

Page generated in 0.0699 seconds