Filters
total: 987
filtered: 892
Search results for: RESTRAINED DOMINATION
-
Weakly connected domination stable trees [online]
PublicationPraca dotyczy pełnej charakteryzacji drzew stabilnych ze względu na liczbę dominowania słabo spójnego.
-
Lower bound on the paired domination number of a tree
PublicationW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
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...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Graphs with convex domination number close to their order
PublicationW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
Enhancing seismic performance of buckling-restrained brace frames equipped with innovative bracing systems
PublicationNowadays, to improve the performance of conventional bracing systems, in which, buckling in the pressure loads is the main disadvantage, the buckling-restrained brace (BRB) is introduced as a solution. In this study, the performance of the BRB system was improved with innovative lateral-resisting systems of double-stage yield buckling-restrained brace (DYB), and a combination of DYB improved with shape memory alloy (SMA) materials...
-
Seismic performance evaluation of steel buckling-restrained braced frames including SMA materials
PublicationThe permanent deformation of the building after seismic excitations can be determined by the Maximum Residual Interstory Drift Ratio (MR-IDR), which may be used for measuring the damage states. Low-post yield stiffness of the steel buckling-restrained braced frame (BRBF) makes this system vulnerable to large MR-IDR after a severe earthquake event. To overcome this issue, this paper investigates the seismic limit state performances...
-
The effects of vehicle restraint systems on road safety
PublicationKey to understanding the needs and tools of road infrastructure management for preventing run-off-road crashes or minimising their consequences, is to identify the hazads and sources of hazards caused by wrong or improper use of road safety devices and identify errors in the desifn, structure, construction and operation of road safety devices. Studying such an extended scope of the problem required fieldwork and surveys with road...
-
Assessment of Road Restraint Systems in Polish Conditions
PublicationKey to understanding the needs and tools of road infrastructure management is identifying the hazards and their sources involved in having no or faulty road restraint systems. Clarity is also needed on why the systems are wrongly designed, constructed, built and operated. To ensure that the problem is adequately understood, research and site observations were conducted and...
-
Assessing vehicle restraint systems on horizontal curves
PublicationHorizontal curves, an element of road infrastructure, have a statistically high number of accidents. Considering that horizontal curves in the last ten years have had app. 10% of all road accidents representing app. 14% of all fatalities on Polish roads, the issue is serious and requires more research and proper road safety treatments. Data for 2007 - 2016 show that in the case of accidents on horizontal curves app. 45% of the...
-
Relations between the domination parameters and the chromatic index of a graph
PublicationIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
A note on the weakly convex and convex domination numbers of a torus
PublicationW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
On trees attaining an upper bound on the total domination number
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Lower bound on the weakly connected domination number of a tree
PublicationPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublicationPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
Lower bound on the distance k-domination number of a tree
PublicationW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Domination numbers in graphs with removed edge or set of edges
PublicationW artykule przedstawiony jest wpływ usuwania krawędzi lub zbioru krawędzi na liczby dominowania spójnego i słabo spójnego.
-
CLASSIFICATION OF RESTRAINTS IN THE OPTIMIZATION PROBLEM OF A COLD-FORMED PROFILE
PublicationThis work describes the restraints in the optimization problem. This is an important and complicated issue because it requires taking into account a vast range of information related to the design and production. In order to describe the relations of a specific optimization problem, it is essential to adopt appropriate criteria and to collect information on all kinds of restraints, i.e. boundary conditions. The following paper...
-
Development and experimental validation of a novel double-stage yield steel slit damper-buckling restrained brace
PublicationThis research is focused on the development and experimental validation of a novel double-stage yield steel slit damper-buckling restrained brace (SSD-DYB) system designed for seismic resistance of steel structures. The SSD-DYB integrates the energy dissipation capability of a steel slit damper (SSD) in its initial segment, enhancing performance in the case of lower seismic intensities levels while employing a larger segment for...
-
Seismic response and performance prediction of steel buckling-restrained braced frames using machine-learning methods
PublicationNowadays, Buckling-Restrained Brace Frames (BRBFs) have been used as lateral force-resisting systems for low-, to mid-rise buildings. Residual Interstory Drift (RID) of BRBFs plays a key role in deciding to retrofit buildings after seismic excitation; however, existing formulas have limitations and cannot effectively help civil engineers, e.g., FEMA P-58, which is a conservative estimation method. Therefore, there is a need to...
-
Road Restraint Systems as a Basis for Roadside Safety Improvement
PublicationRoadside-related crashes occur when vehicles run off the road. The majority of the crashes have severe outcomes, especially when an object is hit (tree, pole, supports, front wall of a culvert, barrier). These accidents represent app. 19% of all of Poland's road deaths. Roadside crashes involve: hitting a tree, hitting a barrier, hitting a sign or utility pole, vehicle roll-over on the roadside, vehicle roll-over on a slope and...
-
Studying road restraint systems to develop new guidelines
PublicationThe paper will present a proposed approach to such work along with preliminary results of numerical studies for selected problems using road safety devices such as safety barriers on horizontal curves, the effect of kerbs on bridges or the location of obstacles within the barrier’s working width. The paper will discuss assumptions to a methodology of numerical models, calculations and automated processing of data to help with assessing...
-
The guidelines and principles for planning and design of road restraint systems
PublicationThe project RID 3A Road Safety Equipment (RoSE) implemented by the Gdansk University of Technology within the RID programme, aims to conduct a comprehensive study and analyses of different vehicle containment systems (PN-EN 1317) and types of support structures (PN-EN 12767) and their performance. Within the project an analysis will be conducted of available research reports...
-
Modeling of entrained flow steam gasification of sewage sludge
PublicationProper management of sewage sludge becomes increasingly problematic due to legal requirements aiming at diminishing environmental impact, as well as rationalizing the utilization from the point of view of logistics. Steam gasification of sewage sludge can result in very good quality of the producer gas. So far, the works have been focused on the gasification in fixed bed gasifiers. However, this does not allow to take full advantage...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a 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. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 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 a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublicationArtykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
An upper bound for the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublicationThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
Analytical approach for membrane action in laterally-restrained reinforced concrete square slabs under uniformly distributed loads
PublicationLaterally-restrained reinforced concrete slabs can mobilise compressive membrane action and subsequent tensile membrane action under extreme loading conditions, thereby enhancing the load resistance under uniformly distributed loads. Previous analytical study focuses primarily on tensile membrane action in simply-supported slabs. This paper describes an analytical approach for membrane action in laterally-restrained square slabs....
-
Retained features of embryonic metabolism in the adult MRL mouse
PublicationThe MRL mouse is an inbred laboratory strain that was derived by selective breeding in 1960 from the rapidly growing LG/J (Large) strain. MRL mice grow to nearly twice the size of other commonly used mouse strains, display uncommonly robust healing and regeneration properties, and express later onset autoimmune traits similar to Systemic Lupus Erythematosis. The regeneration trait (heal) in the MRL mouse maps to 14-20 quantitative...
-
Super Dominating Sets in Graphs
PublicationIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
The role of numerical tests in assessing road restraint system functionality
PublicationKey to understanding the needs and building road infrastructure management tools to prevent and mitigate run-off-road accidents is to identify hazards and their sources which are a result of wrong design, construction, and installation of road restraint systems. Building such tools requires advanced studies with field tests, simulations and models to demonstrate the effects of selected parameters on road user safety. The research...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Open-Set Speaker Identification Using Closed-Set Pretrained Embeddings
PublicationThe paper proposes an approach for extending deep neural networks-based solutions to closed-set speaker identification toward the open-set problem. The idea is built on the characteristics of deep neural networks trained for the classification tasks, where there is a layer consisting of a set of deep features extracted from the analyzed inputs. By extracting this vector and performing anomaly detection against the set of known...
-
The effect of road restraint systems on the level of road safety - Polish experience
PublicationRoadside accidents happen when a vehicle runs off the road. The majority of these accidents are very severe because leaving the road is usually followed by hitting a solid obstacle (tree, pole, support, culvert front wall, barrier). Roadsides are some of the most important issues of road safety. They have been studied for years to identify roadside hazards and the effectiveness of road safety measures such as restraint systems....
-
Buckling and post-buckling behavior of column with central non-linear restraint
PublicationW pracy bada się wyboczenie giętne i zachowanie pokrytyczne ściskanego osiowo pręta z nieliniową sprężystą podporą w środku rozpiętości przęsła. Rozwiązanie problemu wyznaczono za pomocą metody małego parametru. Podano przykład numeryczny wyboczenia i zachowania pokrytycznego swobodnie podpartego pręta z nieliniową sprężytą podporą w środku rozpiętości. Wykazano istotny wpływ nieliniowości podpory na zachowanie pokrytyczne pręta.
-
Minimal double dominating sets in trees
PublicationWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
Minimal 2-dominating sets in Trees
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
On proper (1,2)‐dominating sets in graphs
PublicationIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
The domination of ionic conductivity in tetragonal phase of the organometal halide perovskite CH3NH3PbI3-xClx
PublicationOrganometal trihalide perovskites have recently gained extreme attention due to their high solar energy conversion in photovoltaic cells. Here, we investigate the contribution of iodide ions to a total conductivity of the mixed lead halide perovskite CH3NH3PbI3−xClx with a use of the modified DC Hebb–Wagner polarization method. It has been identified that an ionic conductivity dominates in tetragonal phase which is associated with room...