CiteULike rocarvaj's CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Global Defensive Alliances in Graphs Export

by: Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning

Citation Format

[Posts]

View FullText article


rocarvaj's tags for this article

alliances graphs

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

A defensive alliance in a graph G = (V; E) is a set of vertices S V satisfying the condition that for every vertex v 2 S, the number of neighbors v has in S plus one (counting v) is at least as large as the number of neighbors it has in V S.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.