Wyszukiwarka
Filtry
wszystkich: 441
wybranych: 80
Wyniki wyszukiwania dla: 2-OUTER-INDEPENDENT%20DOMINATION
-
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,...
-
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...
-
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,...
-
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...
-
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...
-
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,...
-
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...
-
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...
-
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...
-
Hybrid no-signaling-quantum correlations
PublikacjaFundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...
-
Artificial neural network prophecy of ion exchange process for Cu (II) eradication from acid mine drainage
PublikacjaThe removal of heavy metal ions from wastewater was found to be significant when the cation exchange procedure was used effectively. The model of the cation exchange process was built using an artificial neural network (ANN). The acid mine drainage waste’s Cu(II) ion was removed using Indion 730 cation exchange resin. Experimental data from 252 cycles were recorded. In a column study, 252 experimental observations validated the...
-
The accretion of the new ice layer on the surface of hexagonal ice crystal and the influence of the local electric field on this process
PublikacjaThe process of creation of a new layer of ice on the basal plane and on the prism plane of a hexagonal ice crystal is analyzed. It is demonstrated that the ordering of water molecules in the already existing crystal affects the freezing. On the basal plane, when the orientations of water molecules in the ice block are random, the arrangement of the new layer in a cubic manner is observed more frequently — approximately 1.7 times...
-
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...
-
Bis(diethylamido-[kappa]N)(diethylamine-[kappa]N)bis(2,6-diisopropylphenylamido-[kappa]N)zirconium(IV)
PublikacjaIn the title compound, [Zr(C12H18N)2(C4H10N)2(C4H11N)] or [Zr(HNC6H3iPr2)2(NEt2)2(HNEt2)], which was obtained by the reaction of Zr(NEt)4 with iPr2C6H3NH2, the Zr IV atom is in a trigonal–bipiramidal geometry in which the N atoms from two iPr2C6H3NH and one NEt2 ligand occupy the equatorial positions, and the N atoms of an NEt2 and an Et2NH ligand occupy the apical positions. An intramolecular N—HN contact occurs. There are two...
-
Photoelectron spectroscopy of brominated derivative of pyrimidine: 2-bromopyrimidine
PublikacjaIn this study the brominated derivative of pyrimidine, 2-bromopyrimidine, was investigated by photoelectron spectroscopy. Outer valence photoelectron spectra recorded at 21.22, 45 and 100 eV photon energy for this compound are presented. The recorded spectra have a higher resolution than that previously reported in the literature. The bromine 3d and 3p edge photoelectron spectra have also been recorded in a photon impact experiment...
-
Lipopolysaccharides: regulated biosynthesis and structural diversity
PublikacjaThe cell envelope of Gram-negative bacteria contains two distinct membranes, an inner (IM) and an outer (OM) membrane, separated by the periplasm, a hydrophilic compartment that includes a thin layer of peptidoglycan. The most distinguishing feature of such bacteria is the presence of an asymmetric OM with phospholipids located in the inner leaflet and lipopolysaccharides (LPSs) facing the outer leaflet. The maintenance of this...
-
High-performance NdSrCo2O5+δ–Ce0.8Gd0.2O2-δ composite cathodes for electrolyte-supported microtubular solid oxide fuel cells
PublikacjaNdSrCo2O5+δ (NSCO) is a perovskite with an electrical conductivity of 1551.3 S cm−1 at 500 °C and 921.7 S cm−1 at 800 °C and has a metal-like temperature dependence. This perovskite is used as the cathode material for Ce0.8Gd0.2O2-δ (GDC)-supported microtubular solid oxide fuel cells (MT-SOFCs). The MT-SOFCs fabricated in this study consist of a bilayer anode, comprising a NiO–GDC composite layer and a NiO layer, and a NSCO–GDC...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublikacjaIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...