Alliances in graphs
The work
| Authors | Petter Kristiansen; Sandra M. Hedetniemi; Stephen T. Hedetniemi |
|---|---|
| Editors | |
| Type | article |
| Year | 2004 |
| Citekey | kristiansen2004alliances |
Where it appeared
| Published in | Journal of Combinatorial Mathematics and Combinatorial Computing |
|---|---|
| Volume | 48 |
| Pages | 157--177 |
From bibtex.
Abstract
A defensive alliance in a graph G = (V, E) is a set of vertices S ⊆ V satisfying the condition that every vertex v ∈ S has at most one more neighbor in V − S than it has in S. Because of such an alliance, the vertices in S, agreeing to mutually support each other, have the strength of numbers to be able to defend themselves from the vertices in V − S. In this paper we introduce this new concept, together with a variety of other kinds of alliances, and initiate the study of their mathematical properties.
A copy is held
pdf, 903.2 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via bibtex |
|---|---|
| Added | 2026-10-23 11:27 UTC |
| Approved by | a person 2026-10-23 11:27 UTC |
Cite it as
@article{kristiansen2004alliances,
title = {Alliances in graphs},
author = {Petter Kristiansen and Sandra M. Hedetniemi and Stephen T. Hedetniemi},
year = {2004},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
volume = {48},
pages = {157--177},
}
This record lives at https://refs.drheap.org/kristiansen2004alliances/ and will keep doing so.