Secure sets and their expansion in cubic graphs

Abstract

Consider a graph whose vertices play the role of members of the opposing groups. The edge between two vertices means that these vertices may defend or attack each other. At one time, any attacker may attack only one vertex. Similarly, any defender fights for itself or helps exactly one of its neighbours. If we have a set of defenders that can repel any attack, then we say that the set is secure. Moreover, it is strong if it is also prepared for a raid of one additional foe who can strike anywhere. We show that almost any cubic graph of order has a minimum strong secure set of cardinality less or equal to /2 + 1. Moreover, we examine the possibility of an expansion of secure sets and strong secure sets. MSC:05C99