Filtry
wszystkich: 7178
-
Katalog
- Publikacje 2909 wyników po odfiltrowaniu
- Czasopisma 48 wyników po odfiltrowaniu
- Osoby 43 wyników po odfiltrowaniu
- Projekty 3 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 34 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 4135 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: X-DOMINATING SET
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating 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...
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $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...
-
Weakly convex domination subdivision number of a graph
PublikacjaA 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...
-
The convex domination subdivision number of a graph
PublikacjaLet 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...
-
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...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $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}...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA 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...
-
Certified domination
PublikacjaImagine 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...
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 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...
-
Common Independence in Graphs
PublikacjaAbstract: 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|...
-
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...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet 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
PublikacjaA 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...
-
Weakly connected Roman domination in graphs
PublikacjaA 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 the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 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
PublikacjaA 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...
-
Trees having many minimal dominating sets
PublikacjaWe 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...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor 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...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor 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...
-
Graphs with equal domination and certified domination numbers
PublikacjaA 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...
-
Minimal 2-dominating sets in Trees
PublikacjaWe 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
PublikacjaWe 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.
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA 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,...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA 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,...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA 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...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublikacjaWe 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
PublikacjaWe 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
PublikacjaWe 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...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA 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
PublikacjaA 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
PublikacjaA 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...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA 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...
-
2-outer-independent domination in graphs
PublikacjaWe 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 Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 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...
-
On trees attaining an upper bound on the total domination number
PublikacjaA 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...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA 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...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven 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
PublikacjaLet 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...
-
Independent Domination Subdivision in Graphs
PublikacjaA 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...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA 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...
-
Isolation Number versus Domination Number of Trees
PublikacjaIf 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)....
-
Secure Italian domination in graphs
PublikacjaAn 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...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract 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.
-
On the super domination number of lexicographic product graphs
PublikacjaThe 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...
-
2-bondage in graphs
PublikacjaA 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...
-
Double bondage in graphs
PublikacjaA 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 2-bondage in graphs
PublikacjaA 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)....
-
Non-isolating bondage in graphs
PublikacjaA 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')...
-
Complexity Issues on of Secondary Domination Number
PublikacjaIn 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...
-
Cyanobacterial blooms in the Gulf of Gdańsk - photo archvive
Dane BadawczeCyanobacterial 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...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublikacjaSmart 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....
-
Fabrication and Crystal Structure of Sol-Gel Deposited BST Thin Films with Compositional Gradient
PublikacjaIn 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...
-
INFLUENCE OF A VERTEX REMOVING ON THE CONNECTED DOMINATION NUMBER – APPLICATION TO AD-HOC WIRELESS NETWORKS
PublikacjaA 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
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,...
-
Structural properties of mixed conductor Ba1−xGd1−yLax+yCo2O6−δ
PublikacjaBa1−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...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublikacjaW 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ą...
-
On the size of identifying codes in triangle-free graphs
PublikacjaIn 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...
-
Light intensity analysis of photovoltaic parameters for perovskite solar cells
PublikacjaThe 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...
-
Zagadnienia tribologiczne w hamulcu silnika hydraulicznego
PublikacjaPrzedmiotem badań był prototypowy hamulec cierny wielopłytkowy do silnika satelitowego SM-0,6 o teoretycznej objętości roboczej 16,7 cm3/obr. Hamulec ten zbudowany był z 27 tarcz ciernych wykonanych z materiału TOLOX oraz z pakietu sprężyn talerzowych zamontowanych w układzie X. Zablokowanie hamulca następuje w skutek siły docisku pakietu sprężyn talerzowych płytek ciernych co następuje w chwili spadku ciśnienia w komorze tłoka...
-
Control of mass concentration of reagents by sound in a gas with nonequilibrium chemical reactions
PublikacjaThe 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...
-
Electron scattering by planar boron-containing molecules BX3(X=F, Cl, CD3)
PublikacjaPraca prezentuje absolutny całkowity przekrój na rozpraszanie elektronów dla drobiny B(CD3)3 w zakresie niskich i średnich energii, otrzymany liniową metodą transmisyjną. Porównanie wyników dla innych płaskich drobin zawierających bor jako atom centralny - BX3(X=F, Cl) ukazuje rolę atomów zewnętrznych w procesie rozpraszania.
-
EXPERIMENTAL INVESTIGATION OF FREE CONVECTION OF GLYCOL-Al2O3 NANOFLUID FROM HORIZONTAL TUBE
PublikacjaNanofluids 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
PublikacjaNanofluids 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...
-
Super Dominating Sets in Graphs
PublikacjaIn 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.
-
Analysis of Residual Stresses and Dislocation Density of AA6082 Butt Welds Produced by Friction Sir Welding
PublikacjaThe 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...
-
Open-Set Speaker Identification Using Closed-Set Pretrained Embeddings
PublikacjaThe 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...
-
Tribo-Environment Dependent Chemical Modification of Sliding Interfaces in Ultrananocrystalline Diamond Nanowall Film: A Correlation with Friction and Wear
PublikacjaTribological 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...
-
Akademia ETI dla X LO - Arduino
Kursy OnlineZajęcia prowadzone przez nauczycieli akademickich WETI dla X Liceum Ogólnokształcącego w Toruniu - Arduino
-
An absorbing set for the Chialvo map
PublikacjaThe classical Chialvo model, introduced in 1995, is one of the most important models that describe single neuron dynamics. In order to conduct effective numerical analysis of this model, it is necessary to obtain a rigorous estimate for the maximal bounded invariant set. We discuss this problem, and we correct and improve the results obtained by Courbage and Nekorkin (2010). In particular, we provide an explicit formula for an...
-
Signature of Oxide-Ion Conduction in Alkaline-Earth-Metal-Doped Y3GaO6
PublikacjaWe 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...
-
Changes in conditions of acoustic wave propagation in the Gdansk deep as an effect of climate changes in the Baltic Sea region
PublikacjaThe 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...
-
SPECTRAL-BASED MODAL PARAMETERS IDENTIFICATION WITH MULTIPLE PARTICLE SWARMS OPTIMIZATION
PublikacjaThe 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...
-
A general isogeometric finite element formulation for rotation‐free shells with in‐plane bending of embedded fibers
PublikacjaThis article presents a general, nonlinear isogeometric finite element formulation for rotation-free shells with embedded fibers that captures anisotropy in stretching, shearing, twisting, and bending - both in-plane and out-of-plane. These capabilities allow for the simulation of large sheets of heterogeneous and fibrous materials either with or without matrix, such as textiles, composites, and pantographic structures. The work...
-
Selected aspects of modern X-ray structural analysis 2024
Kursy OnlineSelected Aspects of Modern X-ray Structural Analysis
-
Selected Aspects of Modern X-ray Structural Analysis 2023
Kursy OnlineSelected Aspects of Modern X-ray Structural Analysis
-
Structural and catalytic properties of ceria layers doped with transition metals for SOFCs fueled by biogas
PublikacjaThe 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
PublikacjaThe 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....
-
Changes in conditions of acoustic wave propagation in the Gdansk deep as an effect of climate changes in the Baltic Sea region
PublikacjaThe 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....
-
Photovoltaic demonstration set up
PublikacjaThe use of photovoltaics is growing rapidly in the industry as well as households. Therefore, educating the public will help them understand solar cell technology, which is becoming more common in everyday life. This paper proposes a demonstrational set-up of photovoltaic panel for the purpose of science education. It was used in numerous outreach activities such as science fairs. Moreover, it proved to be a great tool for education...
-
Nutrient loss from three small-size watersheds in the southern Baltic Sea in relation to agricultural practices and policy
PublikacjaAgriculture 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,...
-
New σ-phases in the Nb–X–Ga and Nb–X–Al systems (X = Ru, Rh, Pd, Ir, Pt, and Au)
PublikacjaPreviously unreported σ-phases in the ternary niobium-based systems Nb–X–Ga for X = Ru, Rh, Pd, Ir, Pt, Au, and Nb–X–Al for X = Ir, and Pt are presented, prepared by arc-melting followed by annealing at 1000 °C for 1 week. The phases are primitive tetragonal (P42/mnm, no. 136) with lattice parameters of a = 9.8336(2)–9.9432(1) Å and c = 5.1098(1)–5.1718(1) Å. Refinements of the single crystal X-ray diffraction data for the Ru and...
-
A chemo-mechano-thermodynamical contact theory for adhesion, friction, and (de)bonding reactions
PublikacjaThis work presents a self-contained continuum formulation for coupled chemical, mechanical, and thermal contact interactions. The formulation is very general and, hence, admits arbitrary geometry, deformation, and material behavior. All model equations are derived rigorously from the balance laws of mass, momentum, energy, and entropy in the framework of irreversible thermodynamics, thus exposing all the coupling present in the...
-
Control of a vapour microturbine set in cogeneration applications
PublikacjaSystems with microturbines are implemented for local generation of heat and electricity. This paper presents the analysis of control concepts for a vapour microturbine set with a generator with permanent magnets, intended to work in small heat and power plants. Control system variants differed by the selection of controlled signals and set parameters. Possible ways of control were discussed and compared with experimentally determined...
-
SET-VALUED ANALYSIS
Czasopisma -
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Developing an Ontology from Set of Experience KnowledgeStructure
PublikacjaWhen referring to knowledge forms,collecting for all decision eventsin a knowledge-explicit way becomes a significant ask for any company. Set of experience knowledge structure can assis in accomplishing this purpose.However,after collecting,distributing and sharing that knowledge as adecisional DNA is even a more important advance.Distributing and sharing companies' decisional DNA through an efficient development of Ontologies...
-
Dissociative ionization dynamics of dielectric gas C3F7CN
PublikacjaFluoronitrile 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...
-
Magnetoelectric effect in (BiFeO3)x–(BaTiO3)1-x solid solutions
PublikacjaThe aim of the present work was to study magnetoelectric effect (ME) in (BiFeO3)x–(BaTiO3)1x solid solutions in terms of technological conditions applied in the samples fabrication process. The rapidly growing interest in these materials is caused by their multiferroic behaviour, i.e. coexistence of both electric and magnetic ordering. It creates possibility for many innovative applications, e.g. in steering the magnetic memory...
-
Asymptotic behaviour in the set of nonhomogeneous chains of stochastic operators
PublikacjaWe study different types of asymptotic behaviour in the set of (infinite dimensional) nonhomogeneous chains of stochastic operators acting on L1(μ) spaces. In order to examine its structure we consider different norm and strong operator topologies. To describe the nature of the set of nonhomogeneous chains of Markov operators with a particular limit behaviour we use the category theorem of Baire. We show that the geometric structure...
-
Music Genre Recognition in the Rough Set-Based Environment
PublikacjaThe aim of this paper is to investigate music genre recognition in the rough set-based environment. Experiments involve a parameterized music data-base containing 1100 music excerpts. The database is divided into 11 classes cor-responding to music genres. Tests are conducted using the Rough Set Exploration System (RSES), a toolset for analyzing data with the use of methods based on the rough set theory. Classification effectiveness...
-
Material Identification of the Human Abdominal Wall Based On the Isogeometric Shell Model
PublikacjaThe human abdominal wall is an object of interest to the research community in the context of ventral hernia repair. Computer models require a priori knowledge of constitutive parameters in order to establish its mechanical response. In this work, the Finite Element Model Updating (FEMU) method is used to identify an heterogeneous shear modulus distribution for a human abdominal wall model, which is based on nonlinear isogeometric...
-
Polietylen sieciowany PE-X
PublikacjaTekst jest opisem nowego materiału PE-X stosowanego do budowy wewnętrznych instalacji wodociągowych i grzewczych.
-
Role of methylation in electron scattering on X(CH3)4 (X = C, Si, Ge) molecules
PublikacjaTotal cross sections (TCS) for low-energy electron scattering from X(CH3)4 (where X = C, Si, Ge) molecules have been measured using linear transmission method. Present results and those obtained previously for XH4 molecules were used to determine how methylation of the target is reflected in TCS energy dependence.
-
Krajobraz nomadyczny w Muittalus samid birra (1910) Johana Turiego
PublikacjaThe 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,...
-
Control of the wind turbine generator
PublikacjaWind 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...
-
Impact Behaviour of Glass Fribre /Epoxy Composites with Nano-Enhanced Resin after Water Exposure
PublikacjaImpact 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....
-
Study of the Layer-Type BST Thin Film with X-ray Diffraction and X-ray Photoelectron Spectroscopy
PublikacjaIn the present paper, results of X-ray photoelectron studies of electroceramic thin films of barium strontium titanate, Ba1xSrxTiO3 (BST), composition deposited on stainless-steel substrates are presented. The thin films were prepared by the sol-gel method. A spin-coating deposition of BST layers with different chemical compositions was utilized so the layer-type structure of (0-2) connectivity was formed. After the deposition,...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Electron collisions with X(CH3)4 molecules (X = C, Si, Ge)
PublikacjaAbsolute grand-total cross sections (TCSs) for electron scattering from tetramethylmethane [C(CH3)4], tetramethylsilane [Si(CH3)4], and tetramethylgermane [Ge(CH3)4] molecules have been measured at electron-impact energies extending from around 0.5 to 300 eV in the linear electron-transmission experiment. The measured TCS energy dependences show very pronounced broad enhancement, peaking near 5.5 eV for Si(CH3)4 and Ge(CH3)4 molecules...
-
Isogeometric Shell FE Analysis of the Human Abdominal Wall
PublikacjaIn this paper a nonlinear isogeometric Kirchhoff-Love shell model of the human abdominal wall is proposed. Its geometry is based on in vivo measurements obtained from a polygon mesh that is transformed into a NURBS surface, and then used directly for the finite element analysis. The passive response of the abdominal wall model under uniform pressure is considered. A hyperelastic membrane model based on the Gasser-Ogden-Holzapfel...