Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning  Home/Search
Context
Related
| combinatorics.org/Volume_...v10i1r47.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: combinatorics.org/Volu...v10i1toc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Active bibliography (related documents): More All
1.0: Global Defensive Alliances in Graphs - Teresa Haynes Stephen (Correct)
0.0: Approximating the Domatic Number - Feige, Halldórsson, Kortsarz (2000) (Correct)
0.0: A Self-Stabilizing Distributed Algorithm for.. - Goddard.. (2003) (Correct)
Similar documents based on text: More All
0.3: n-Queens - Kosters (2000) (Correct)
0.3: Fault Tolerant Distributed Coloring Algorithms That.. - Hedetniemi, Jacobs.. (2002) (Correct)
0.2: Fault Tolerant Algorithms for Orderings and Colorings - Goddard, Hedetniemi.. (2004) (Correct)
BibTeX entry: (Update)
@misc{ haynes-global,
author = "Teresa W. Haynes and Stephen T. Hedetniemi and Michael A. Henning",
title = "Global Defensive Alliances in Graphs",
url = "citeseer.ist.psu.edu/haynes03global.html" }
Citations (may not include all citations):47 Fundamentals of Domination in Graphs (context) - Haynes, Hedetniemi et al. - 1998
13 Domination in Graphs: Advanced Topics (context) - Haynes, Hedetniemi et al. - 1998
2 Digraphs: Third Edition (context) - Chartrand, Lesniak - 1996
2 Submitted for publication (context) - Hedetniemi, Hedetniemi et al.
Documents on the same site (http://www.combinatorics.org/Volume_10/v10i1toc.html): More
A Note on Graph Coloring Extensions and List-Colorings - Axenovich (2003) (Correct)
Packing 10 or 11 Unit Squares in a Square - Stromquist (2003) (Correct)
Switching of edges in strongly regular graphs. I. A family of .. - Jørgensen, Klin (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC