Search
Filters
total: 92
Search results for: dominating set
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
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.
-
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...
-
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.
-
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.
-
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...
-
Trees having many minimal dominating sets
PublicationWe provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
An algorithm for listing all minimal double dominating sets of a tree
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.
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublicationSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
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...
-
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...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 2-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. A 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 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublicationFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
On trees with double domination number equal to total domination number plus one
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. A vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
The convex domination subdivision number of a graph
PublicationLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Total domination in versus paired-domination in regular graphs
PublicationA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Weakly convex domination subdivision number of a graph
PublicationA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Global defensive sets in graphs
PublicationIn 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...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
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...
-
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,...
-
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...
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
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...
-
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...
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
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...
-
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}...
-
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...
-
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...
-
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)....
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
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...
-
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...
-
On the 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...
-
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')...
-
Non-isolating 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 non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Certified domination
PublicationImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
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|...
-
INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS
PublicationA minimum connected dominating set (MCDS) can be used as virtual backbone in ad-hoc wireless networks for efficient routing and broadcasting tasks. To find the MCDS is an NP- complete problem even in unit disk graphs. Many suboptimal algorithms are reported in the literature to find the MCDS using local information instead to use global network knowledge, achieving an important reduction in complexity. Since a wireless network...
-
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,...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Global defensive secure structures
PublicationLet 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...
-
Cyanobacterial blooms in the Gulf of Gdańsk - photo archvive
Open Research DataCyanobacterial blooms are recorded in the Gulf of Gdańsk every summer. The dataset contains 20 photographs of the blooms of these microorganisms taken between 2004 and 2012. In addition to the photos, the dataset also contains a file with supporting information, such as the coordinates of the point where the photo was taken, the salinity and temperature...
-
Nutrient loss from three small-size watersheds in the southern Baltic Sea in relation to agricultural practices and policy
PublicationAgriculture is the major contributor of waterborne nutrient fluxes into the Baltic Sea, one of the world’s most eutrophication-sensitive areas. Poland, as a large, densely populated state ohf the Baltic Region, with dominating agricultural land use, largely contributes to riverborne loads of N and P. The aim of our study was to examine the input of nutrients from three small first-order agricultural watersheds (Bladzikowski Stream,...
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Light intensity analysis of photovoltaic parameters for perovskite solar cells
PublicationThe number of publications on perovskite solar cells (PSC) continues to grow exponentially. Although the efficiency of PSC is exceeded 25.5%, not every research laboratory can reproduce this result or even pass the border of 20%. Unfortunately, it is not always clear which dominating mechanism is responsible for the performance drop. Here, we develop a simple method of light intensity analysis of JV parameters allowing the understanding...
-
Control of mass concentration of reagents by sound in a gas with nonequilibrium chemical reactions
PublicationThe weakly nonlinear dynamics of a chemically reacting gas is studied. Nonlinear interaction of acoustic and nonacoustic types of motion are considered. We decompose the base equations using the relationships of the gas-dynamic perturbations specific for every type of motion. The governing equation for the mass fraction of a reagent influenced by dominating sound is derived and discussed. The conclusions concern the equilibrium...
-
EXPERIMENTAL INVESTIGATION OF FREE CONVECTION OF GLYCOL-Al2O3 NANOFLUID FROM HORIZONTAL TUBE
PublicationNanofluids came to be seen as a new generation of coolants, both in single- and two phase systems. Furthermore, nanofluids or nanocomposites may be used as a media in a thermal energy storage (TES) in such systems as sensible heat storage (SHS) and phase change materials (PCM). In the SHS systems the dominating mechanism of the heat transfer is natural convection. However, in the literature only a few investigations of free convection...
-
Experimental investigation of free convection of glycol-Al2O3 nanofluid from horizontal tube
PublicationNanofluids came to be seen as a new generation of coolants, both in single- and two phase systems. Furthermore, nanofluids or nanocomposites may be used as a media in a thermal energy storage (TES) in such systems as sensible heat storage (SHS) and phase change materials (PCM). In the SHS systems the dominating mechanism of the heat transfer is natural convection. However, in the literature only a few investigations of free convection...
-
Analysis of Residual Stresses and Dislocation Density of AA6082 Butt Welds Produced by Friction Sir Welding
PublicationThe Friction Stir Welding (FSW) method was employed to join AA6082 sheets. The welds were produced with different tool traverse speed (200 and 250 mm/min), rotational speed (1000 and 1250 RPM) and tool tilt angle (0 and 2 deg). Based on the analysis of XRD patterns, the total precipitation volume fractions in the nugget zones and the base material were calculated. The FSW process resulted in a reduction in the fraction of precipitates...
-
SPECTRAL-BASED MODAL PARAMETERS IDENTIFICATION WITH MULTIPLE PARTICLE SWARMS OPTIMIZATION
PublicationThe paper presents usage of a Particle Swarm Optimization [1] based algorithm for spectral-based modal parameters identification. The main algorithm consists of two groups of swarms, namely, scouts and helpers. For the first group additional penalizing process is provided to force separation of scouting swarms in frequency space. The swarms have an ability to communicate with each other. At first stage, each swarm focuses on a...
-
Changes in conditions of acoustic wave propagation in the Gdansk deep as an effect of climate changes in the Baltic Sea region
PublicationThe article presents the results from a research project investigating acoustic climate changes in the Gdansk Deep based on data extending from 1902 to 2019. This part of the southern Gotland Basin, is rarely discussed in the scientific literature. The speed of sound in the seawater is a function of temperature, salinity, and depth. In such shallow sea as Baltic Sea, the impact of depth is not substantial. The other two factors...
-
Changes in conditions of acoustic wave propagation in the Gdansk deep as an effect of climate changes in the Baltic Sea region
PublicationThe article presents the results from a research project investigating acoustic climate changes in the Gdansk Deepbased on data extending from 1902 to 2019. This part of the southern Gotland Basin, is rarely discussed in thescientific literature.The speed of sound in the seawater is a function of temperature, salinity, and depth. In such shallow sea asBaltic Sea, the impact of depth is not substantial....
-
Structural and catalytic properties of ceria layers doped with transition metals for SOFCs fueled by biogas
PublicationThe aim of this paper was to investigate an influence of the nanocrystalline Ce0.8A0.2O2-δ (A = Mn, Fe, Co, Ni, Cu) materials on the direct internal reforming of biogas in SOFC. Structural analysis of fabricated compounds has been done. An in-situ analysis of a composition of outlet gases from operating SOFC was performed using FTIR spectroscopy with simultaneous electrical tests. It was found out, that type of dopant strongly...
-
Portico Farmhouses of the Vistula Delta: Architecture, Current State and Finite Element Modelling of Timber Roof Truss under Material and Cross-section Uncertainty
PublicationThe article focuses on the oldest surviving I-type portico houses located in the Vistula Delta, which were built in the 17th and 18th centuries. The study describes the houses’ origins, structure, details of roof structures and technical condition, and it also includes numerical modelling of a roof truss and its mechanical analysis. Numerical models of the roof trusses are defined and analysed by means of the finite element method....
-
Dissociative ionization dynamics of dielectric gas C3F7CN
PublicationFluoronitrile C3F7CN is a promising candidate for the replacement of SF6 dielectric gas in high-voltage insulation. We present a combined experimental and theoretical study on its ionization dynamics probed in the 0-100 eV energy range. We exploited the total ion collection technique to determine the absolute ionization cross section, mass spectrometry to determine the fragment branching ratios and ab initio nonadiabatic molecular...
-
Fabrication and Crystal Structure of Sol-Gel Deposited BST Thin Films with Compositional Gradient
PublicationIn the present research technology of compositionally graded barium strontium titanate Ba1-xSrxTiO3 thin films deposited on stainless steel substrates by sol-gel spin coating followed with thermal annealing at T = 650°C is reported. Results of thermal behavior of the sol-gel derived powders with compositions used for fabrication of graded structure (i.e. with Sr mole fraction x = 0.5, 0.4 and 0.3) are described. X-ray diffraction...
-
Structural properties of mixed conductor Ba1−xGd1−yLax+yCo2O6−δ
PublicationBa1−xGd1−yLax+yCo2O6−δ (BGLC) compositions with large compositional ranges of Ba, Gd, and La have been characterised with respect to phase compositions, structure, and thermal and chemical expansion. The results show a system with large compositional flexibility, enabling tuning of functional properties and thermal and chemical expansion. We show anisotropic chemical expansion and detailed refinements of emerging phases as La is...
-
Control of the wind turbine generator
PublicationWind power system consists of two main parts: wind turbine and electrical generator. Wind turbine converts the energy of the flowing air into mechanical energy, next generator converts this energy into electrical energy that is sent to the power system. These two processes should be realized with maximum efficiency and the following requirements for the control system can be formulated: opti-mal wind power conversion, compensation...
-
Krajobraz nomadyczny w Muittalus samid birra (1910) Johana Turiego
PublicationThe article introduces Muittalus samid birra (1910, An account of the Sami) by Johan Turi, the fi rstbook with a secular content written in the sami language by a sami person. The author, a wolf hunterand reindeer-breeder, describes a broad spectrum of his people’s daily life. Pictures of everydayactivities are supplemented with stories about the sami people’s knowledge of the world (traditions,myths,...
-
Impact Behaviour of Glass Fribre /Epoxy Composites with Nano-Enhanced Resin after Water Exposure
PublicationImpact behaviour of glass fibre /epoxy composites with nano- SiO2 modified resin was studied in terms of low velocity impact after water exposure. Nanocomposites with 1%, 2%, 3% 5% 7% nano-SiO2 (Nanopox- Evonic) were investigated. Peak impact load and impact damage area as a function of nanoparticle contents were compared for dry specimens and for samples exposed to water (0.7 %wt. 1.7% water absorbed) at 1J, 2J 3J impact energies....
-
QRS Morphology-Based EDR Signal—Factors Determining its Properties
PublicationRespiration-induced signals contain a clinically significant information. It could be obtained utilizing both direct and indirect methods. ECG-Derived Respiration (EDR) method is the latter one. However, in this case, two approaches could be distinguished. First one is based on determining changes in the morphology of QRS complexes while the second one is based on the Respiratory Sinus Arrhythmia (RSA) mechanism. The former approach...
-
A coupled constitutive model for fracture in plain concrete based on continuum theory with non-local softening and eXtended Finite Element Method
PublicationThe paper presents a constitutive model for concrete which combines a continuous and discontinuous fracture description. In a continuum regime, two different constitutive laws were used. First, a plasticity model with a Rankine failure criterion and an associated fl ow rule was used. Second, a constitutive law based on isotropic damage mechanics was formulated. In order to capture the width of a localized zone and to obtain mesh-independent...
-
Determination of polybrominated diphenyl ethers (PBDEs) in dust samples collected in air conditioning filters of different usage – method development
PublicationThis study presents the results of studies aimed at the development of an analytical procedure for separation, identification, and determination of PBDEs compounds in dust samples collected from automotive cabin air filters and samples collected from filters installed as part of the air purification system in academic facilities. Ultrasound-assisted dispersive solid phase extraction (UA-dSPE) was found to perform better in terms...
-
Occurrence and levels of polybrominated diphenyl ethers (PBDEs) in house dust and hair samples from Northern Poland; an assessment of human exposure
PublicationPolybrominated diphenyl ethers (PBDEs) are among most ubiquitous compounds to be found in indoor environment and ingestion of household dust is considered an important route of exposure to PBDEs, especially in toddlers and young children. The present work reported concentration levels of PBDE congeners (PBDE-28, -47, -99, -100, -153, -154, -183 and -209) in hair and dust samples from selected households from Northern Poland. The...
-
Effects of UV light irradiation on fluctuation enhanced gas sensing by carbon nanotube networks
PublicationThe exceptionally large active surface-to-volume ratio of carbon nanotubes makes it an appealing candidate for gas sensing applications. Here, we studied the DC and low-frequency noise characteristics of a randomly oriented network of carbon nanotubes under NO2 gas atmosphere at two different wavelengths of the UV light-emitting diodes. The UV irradiation allowed to sense lower concentrations of NO2 (at least 1 ppm) compared to...
-
Linking optical and electronic properties to photoresponse of heterojunctions based on titania nanotubes and chromium, molybdenum, and tungsten oxides
PublicationThe development of photosensitization strategies for titanium dioxide is necessary for the enhancement of its optical and electronic properties towards its application potential in solar photoelectrochemistry. In this work, significant differences in the photosensitizing capability of the 6th group transition metal oxides applied on the surface of titania nanotubes are reported. For the first time, correlations between the experimentally...
-
Enhanced gas sensing by graphene-silicon Schottky diodes under UV irradiation
PublicationThe effect of ultraviolet (UV) or blue irradiation on graphene/n-doped silicon Schottky junctions toward gas sensing was investigated. Schottky diodes were subjected to oxidizing nitrogen dioxide (NO2, 1–3 ppm) and reducing tetrahydrofuran (THF, 50–200 ppm), showing significantly different responses observed on the currentvoltage (I-V) characteristics, especially under UV light (275 nm). NO2 affected the resistive part of the forward region...
-
Production of essential oils from in vitro cultures of Caryopteris species and comparison of their concentrations with in vivo plants
PublicationThe chemical composition of hydrodistilled essential oils obtained from aerial parts and roots of selected Caryopteris (‘bluebeard’) species (C. incana, C. mongolica, Caryopteris 9 clandonensis), as well as the newly established in vitro shoot and adventitious root cultures of the above plants, was analyzed by gas chromatography– mass spectrometry. Essential oil content and composition differed significantly depending on the type...
-
Comparative analysis of thermodynamic cycles of selected nuclear ship power plants with high-temperature helium-cooled nuclear reactor
PublicationThis paper presents a comparative analysis of thermodynamic cycles of two ship power plant systems with a high-temperature helium- cooled nuclear reactor. The first of them is a gas system with recuperator , in which classical gas chamber is substituted for a HTGR reactor (High Temperature Gas-cooled Reactor) . The second of the considered cycles is a combined gas-steam system where working medium flux from gas turbine outlet...
-
Potential reduction of traffic noise by the means of increased fleet of electric vehicles using a combination of low-noise tyres and low-noise road surfaces
PublicationIn the future, the number of zero-emission vehicles like electric and plug-in hybrid vehicles (in electric mode) is expected to be a substantial part of the vehicle fleet. In Norway, such vehicles already account for approximately 20 % of all new cars sold. Since these vehicles emit negligible noise related to the power-train, the tyre/road noise is the dominating noise source. In the LEO project, tyres designed for such cars have...
-
Improving Accuracy of Contactless Respiratory Rate Estimation by Enhancing Thermal Sequences with Deep Neural Networks
PublicationEstimation of vital signs using image processing techniques have already been proved to have a potential for supporting remote medical diagnostics and replacing traditional measurements that usually require special hardware and electrodes placed on a body. In this paper, we further extend studies on contactless Respiratory Rate (RR) estimation from extremely low resolution thermal imagery by enhancing acquired sequences using Deep...
-
Real-time hybrid model of a wind turbine with doubly fed induction generator
PublicationIn recent years renewable sources have been dominating power system. The share of wind power in energy production increases year by year, which meets the need to protect the environment. Possibility of conducting, not only computer simulation, but also laboratory studies of wind turbine operation and impact on the power system and other power devices in laboratory conditions would be very useful. This article presents a method...
-
Singlet oxygen-dominated peroxymonosulfate activation by layered crednerite for organic pollutants degradation in high salinity wastewater
PublicationAdvanced oxidation processes have been widely studied for organic pollutants treatment in water, but the degradation performance of radical-dominated pathway was severely inhibited by the side reactions between the anions and radicals, especially in high salinity conditions. Here, a singlet oxygen (1O2)-dominated non-radical process was developed for organic pollutants degradation in high salinity wastewater, with layered crednerite...
-
L'industria e la Storia. La lezione di Giorgio Mori
PublicationThe wide contribution of Giorgio Mori for a better understanding of the long-term historical relationships between history and industry is the focus of this chapter. By analysing the long list of books and articles written all along his scientific and academic life it is possible to trace a sort of fil rouge that permits to appreciate the huge effort made by this scholar in offering a fresh and never banal interpretation of the...
-
Deciphering the Molecular Mechanism of Substrate-Induced Assembly of Gold Nanocube Arrays toward an Accelerated Electrocatalytic Effect Employing Heterogeneous Diffusion Field Confinement
PublicationThe complex electrocatalytic performance of gold nanocubes (AuNCs) is the focus of this work. The faceted shapes of AuNCs and the individual assembly processes at the electrode surfaces define the heterogeneous conditions for the purpose of electrocatalytic processes. Topographic and electron imaging demonstrated slightly rounded AuNC (average of 38 nm) assemblies with sizes of ≤1 μm, where the dominating patterns are (111) and...
-
Monitoring strategy for industrially contaminated rivers - A study of all year round behaviour of Klodnica river catchment, upper Silesia, Poland
PublicationThe study was undertaken to thoroughly characterise the contamination of water in industrially influenced river Klodnica, in order to explore monitoring strategies in case of limited analytical capacity. Statistical analysis undertaken after a short study was found to be helpful in reducing monitoring efforts in the future.Klodnica river is located within area of dominating coal mining, metallurgy, and additionally being influenced...
-
Two bacterial small heat shock proteins, IbpA and IbpB, form a functional heterodimer
PublicationSmall heat shock proteins (sHsps) are a conserved class of ATP-independent chaperones which in stress conditions bind to unfolded protein substrates and prevent their irreversible aggregation. Substrates trapped in sHsps-containing aggregates are efficiently refolded into native structures by ATP-dependent Hsp70 and Hsp100 chaperones. Most γ-proteobacteria possess a single sHsp (IbpA), while in a subset of Enterobacterales, as...
-
Tribo-Environment Dependent Chemical Modification of Sliding Interfaces in Ultrananocrystalline Diamond Nanowall Film: A Correlation with Friction and Wear
PublicationTribological properties of ultrananocrystalline diamond nanowall (UNCD NW) films were investigated quantitatively in three different and controlled tribo-environmental conditions, proposing the passivation and graphitization mechanisms. However, these mechanisms are rather complicated and possibly can be understood in well-controlled tribological conditions. It was shown that the friction and wear of these films were high in highPage 1...
-
Signature of Oxide-Ion Conduction in Alkaline-Earth-Metal-Doped Y3GaO6
PublicationWe have studied alkaline-earth-metal-doped Y3GaO6 as a new family of oxide-ion conductor. Solid solutions of Y3GaO6 and 2% −Ca2+-, −Sr2+-, and −Ba2+-doped Y3GaO6, i.e., Y(3−0.06)M0.06GaO6−δ (M = Ca2+, Sr2+, and Ba2+), were prepared via a conventional solid-state reaction route. X-ray Rietveld refined diffractograms of all the compositions showed the formation of an orthorhombic structure having the Cmc21 space group. Scanning electron...
-
Architectural Symbols of a City – Case Study
PublicationThe identity of a city is understood as a collection of individual features, which give the city its individual character and distinguish it from other places; it undoubtedly constitutes a cultural value, which should be cherished. In the case of Sopot – a spa located on the Bay of Gdansk, the mosaic of its geographical location, landscape values, urban layout and historic architecture has created a unique image of a seaside resort....