Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników


2014 | 12 | 11 | 1664-1673

Tytuł artykułu

Secure sets and their expansion in cubic graphs

Treść / Zawartość

Warianty tytułu

Języki publikacji



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 n has a minimum strong secure set of cardinality less or equal to n/2 + 1. Moreover, we examine the possibility of an expansion of secure sets and strong secure sets.

Słowa kluczowe










Opis fizyczny





  • [1] Brigham R.C., Dutton R.D., Hedetniemi S.T., Security in graphs, Discrete Appl. Math., 2007, 155, 1708–1714.
  • [2] Brigham R.C., Dutton R.D., Haynes T.W., Hedetniemi S.T., Powerful alliances in graphs, Discrete Math., 2009, 309, 2140–2147.
  • [3] Brinkmann G., Goedgebeur J., McKay B., Generation of Cubic graphs, Discrete Math. Theor. Comput. Sci., North America, jul. 2011, 13. Available at:
  • [4] Brinkmann G., Goedgebeur J., Mélot H., Coolsaet K., House of Graphs: a database of interesting graphs, Discrete Appl. Math., 2013, 161, 311–314. Available at:
  • [5] Bussemaker F.C., Seidel J.J., Cubical graphs of order 2 ≤ 10, T.H. Eindhoven, 1968, Note No.10.
  • [6] Dutton R.D., On graph’s security number, Discrete Math., 2009, 309, 4443–4447.
  • [7] Dutton R.D., Lee R., Brigham R.C., Bounds on graph’s security number, Discrete Appl. Math., 2008, 156, 695–704.
  • [8] Dutton R., Ho Y.Y., Global secure sets of grid-like graphs, Discrete Appl. Math., 2011, 159, 490–496.
  • [9] Haynes T.W., Hedetniemi S.T., Henning M.A., Global defensive alliances in graphs, Electron. J. Combin., 2003, 10(1), R47.
  • [10] Haynes T.W., Knisley D.J., Seier E., Zou Y., A quantitative analysis of secondary RNA structure using domination based parameters on trees, BMC Bioinformatics, 2006, 7:108.
  • [11] Kristiansen P., Hedetniemi S.M., Hedetniemi S.T., Alliances in graphs, J. Combin. Math. Combin. Comput., 2004, 48, 157–177.
  • [12] Jesse-Józefczyk K., Bounds on global secure sets in cactus trees, Cent. Eur. J. Math., 2012, 10(3), 1113–1124.
  • [13] Jesse-Józefczyk K., The possible cardinalities of global secure sets in cographs, Theor. Comput. Sci., 2012, 414(1), 38–46.
  • [14] Jesse-Józefczyk K., Monotonicity and expansion of global secure sets, Discrete Math., 2012, 312, 3451–3456.
  • [15] Moshi A.M., Matching Cutsets in Graphs, J. Graph Theory, 1989, 13, 527–536.
  • [16] Shafique K.H., Partitioning a Graph in Alliances and its Application to Data Clustering. Ph. D. Thesis, 2004.
  • [17] Sigarreta J.M., Rodríguez J.A., On the global offensive alliance number of a graph, Discrete Appl. Math., 2009, 157, 219–226.
  • [18] Srimani P.K., Xu Z., Distributed protocols for defensive and offensive alliances in network graphs using self-stabilization, Proceedings of the International Conference on Computing: Theory and Applications, 2007, 27–31.
  • [19] de Vries J., Over vlakke configuraties waarin elk punt met twee lijnen incident is. Verslagen en Mededeelingen der Koninklijke Akademie voor Wetenschappen, Afdeeling Natuurkunde, 1889, (3) 6, 382–407.
  • [20] de Vries J., Sur les configurations planes dont chaque point supporte deux droites. Rendiconti Circolo Mat. Palermo, 1891, 5, 221–226.
  • [21] Yahiaoui S., Belhoul Y., Haddad M., Kheddouci H., Self-stabilizing algorithms for minimal global powerful alliance sets in graphs, Inf. Process. Lett., 2013, 113, 365–370.

Typ dokumentu



Identyfikator YADDA

JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.