Search
Filters
total: 879
Search results for: strategic balance in graphs
-
Strategic balance in graphs
PublicationFor 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,...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublicationW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
GRAPHS AND COMBINATORICS
Journals -
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Balance recognition on the basis of EEG measurement.
PublicationAlthough electroencephalography (EEG) is not typically used for verifying the sense of balance, it can be used for analysing cortical signals responsible for this phenomenon. Simple balance tasks can be proposed as a good indicator of whether the sense of balance is acting more or less actively. This article presents preliminary results for the potential of using EEG to balance sensing....
-
Strategic aspects in spatial planning - theory and practice in largest cities of Poland
PublicationThe rate of changes and the growing uncertainty rise to the need for a strategic approach to development planning, which is active and flexible in relation to the changing reality. Strategic planning, occurring in companies, was adapted by the social-economic development planning of self-government units. However, there are difficulties in applying the strategic planning in the spatial planning and integration of the two forms...
-
The Military Balance
Journals -
Work–life balance: Does age matter?
PublicationWork-life balance is a priority of EU policies but at the same time demographic change affects the labour market. Employers have to deal with the ageing of their employees and adjust human resource management to maintain their competitiveness. The purpose of the article is to answer research questions: whether the age of workers determines their assessment of the work-life balance, and whether there is a relationship between the...
-
Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Some variations of perfect graphs
PublicationWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Independent Domination Subdivision in Graphs
PublicationA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
THE EUROPEAN UNION AND JAPAN TOWARDS STRATEGIC PARTNERSHIP AGREEMENT AND ECONOMIC PARTNERSHIP AGREEMENT
PublicationThis 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...
-
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
Global edge alliances in graphs
PublicationIn 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...
-
Some Progress on Total Bondage in Graphs
PublicationThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
STRATEGIC MANAGEMENT
e-Learning Courses -
STRATEGIC MANAGEMENT
e-Learning Courses -
Algorithms for testing security in graphs
PublicationIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
Balance error generated by numerical diffusion in the solution of Muskingum equation
PublicationIn the paper the conservative properties of the lumped hydrological models with variable parameters are discussed. It is shown that in the case of the non-linear Muskingum equation the mass balance is not satisfied. The study indicates that the mass balance errors are caused by the improper form of equation and by the numerical diffusion which is generated in the solution. It has been shown that the classical way of derivation...
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
ROAD SAFETY MANAGEMENT TOOLS FOR COUNTRY STRATEGIC LEVEL
PublicationStrategic road safety programmes setting out long-term visions and road infrastructure development plans must be based on road safety forecasts and an understanding of the long-term impact of different measures on road safety. The objective of this paper is to discuss a concept of road safety management for an area of a selected country because there are no simple tools of road safety management for the development and implementation...
-
On-line P-coloring of graphs
PublicationFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
A New Rehabilitation Device for Balance Impaired Individuals
PublicationIn the paper authors present a device designed to improve the rehabilitation process of people with balance impairment. The discussed device (JStep) utilizes a commercially available static standing frame (stander) modified in order to fit force sensing units under the feet and in the pillows around the hips of a patient. While executing rehabilitation tasks, the patient may compensate his balance deficiency by leaning on the pillows...
-
A note on total reinforcement in graphs
PublicationIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Determinants of trade balance in Polish and Czech manufacturing sectors
PublicationResearch background: A strong industrial base is essential for achieving long-term sustainable economic growth and export competitiveness. In that sense, manufacturing remains a significant contributor to exports in the CEE countries. However, its role and its influence vary between CEE economies and change over time. Purpose of the article: The main objective of this paper is to compare the determinants of the international competitiveness,...
-
On the metric dimension of corona product graphs
PublicationWe give several results on the metric dimension of corona product graphs.
-
Are you a Strategic Thinker? WINTER 24
e-Learning CoursesThe course explores strategic management choices along with the role of innovation in creating sustainable competitive advantage. It introduces frameworks and tools of strategic management (e.g. how to analyze organizations in their industry context and how to design and execute a coherent strategy). Concepts such as value creation, product diversification, clustering and open innovation will be explored to understand how entrepreneurs...
-
Carbon balance of SOFC fueled by biogas mixture at 750 C
Open Research DataThe dataset contains the calculated carbon balance for the SOFC fueled by synthetic biogas mixture (60:40 CH4:CO2). The outlet concentration of the gases from SOFC were measured using novel FTIR-based unit.
-
Balance Between Creativity and Methodology in Software Projects
PublicationTaking into account trends of innovation in economy and increasing interest in applying creativity techniques in computer science, this paper focuses on relationship between creativity and methodology in software project. First, it extracts useful knowledge about creativity from creativity research. Then, it makes an attempt to combine creativity issues and dimensions with concepts from software project area. It presents also lessons...
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
MOOCs in SP4CE - case studies (Strategic Partnership for Creativity and Entrepreneurship)
PublicationSP4CE stands for Strategic Partnership for Creativity and Entrepreneurship project which has been funded with support from the European Commission under the ERASMUS+ Programme in the period 1st September 2014 - 31st August 2017. The main purpose of SP4CE project is to design innovative e-learning tools for collaboration between students, enterprises and teachers. It concentrates on identifying users’ needs and supports the development...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Colorings of the Strong Product of Circulant Graphs
PublicationGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
Bondage number of grid graphs
PublicationThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Hearing Balance and Communication
Journals -
Carbon Balance and Management
Journals -
Theory and Applications of Graphs
Journals -
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
2-outer-independent domination in graphs
PublicationWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Pressure losses and power balance in the unloaded satellite pump
PublicationThis paper presents the results of laboratory research the pressure drop in the internal channels of unloaded satellite pump pumping tap water. Also shows the characteristics of the increase of pressure in the working chamber of the pump. It has been shown that after reaching cavitation, increase pump speed will increase in torque. This is the moment of inertia caused by the increase of the operating mechanism and the liquid contained...
-
PRESSURE LOSSES AND POWER BALANCE IN THE UNLOADED SATELLITE PUMP
PublicationThis paper presents the results of laboratory research the pressure drop in the internal channels of unloaded satellite pump pumping tap water. Also shows the characteristics of the increase of pressure in the working chamber of the pump. It has been shown that after reaching cavitation, increase pump speed will increase in torque. This is the moment of inertia caused by the increase of the operating mechanism and the liquid contained...
-
Edge coloring of graphs of signed class 1 and 2
PublicationRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
Strategic Flexibility as a Mediator in Relationship between Managerial Decisions and Organizational Learning: Ambidexterity Perspective
PublicationPurpose: The purpose of the article is to determine strategic flexibility in the relationship between managerial decisions and organizational learning. The analyses are conducted in the ambidexterity convection. Design/Methodology/Approach: The study was conducted at a textile company. The company is a leader in the textile recycling industry in Poland. Empirical data were collected using the PAPI technique. The survey questionnaire...
-
The hat problem on a union of disjoint graphs
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Balance errors in numerical solutions of shallow water equations
PublicationThe analysis of the conservative properties of the shallow water equations is presented in the paper. The work focuses on the consistency of numerical solution of these equations with the conservation laws of mass and momentum. The investigations involve two different conservative forms which are solved by an implicit box scheme. The theoretical analysis supported by numerical experiments is carried out for rectangular channel...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Common Independence in Graphs
PublicationAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Deterministic Rendezvous in Restricted Graphs
PublicationIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...