Wyszukiwarka
Filtry
wszystkich: 8
wybranych: 7
Filtry wybranego katalogu
Wyniki wyszukiwania dla: global alliance
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Global defensive secure structures
PublikacjaLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
THE EUROPEAN UNION AND JAPAN TOWARDS STRATEGIC PARTNERSHIP AGREEMENT AND ECONOMIC PARTNERSHIP AGREEMENT
PublikacjaThis study aims to reveal the evolution of EU-Japan relations towards comprehensive and fully formalized strategic partnership, the main determinants of that process, as well the importance of the political and economic alliance. In the evolution of EU-Japan relations, there were identified four stages - 1960-1990, 1991-2000, 2001-2010, 2011-2018 - which had led up to strategic partnership regulated by the framework political...
-
Polyurethane based hybrid ciprofloxacin-releasing wound dressings designed for skin engineering purpose
PublikacjaPurpose Even in the 21st century, chronic wounds still pose a major challenge due to potentially inappropriate treatment options, so the latest wound dressings are hybrid systems that enable clinical management, such as a hybrid of hydrogels, antibiotics and polymers. These wound dressings are mainly used for chronic and complex wounds, which can easily be infected by bacteria. Materials and methods Six Composite Porous Matrices...