Wyszukiwarka
Wyniki wyszukiwania dla: TOTAL OUTER-INDEPENDENT DOMINATION
-
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...
-
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,...
-
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...
-
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,...
-
Total outer-connected domination in trees
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
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...
-
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...
-
Total outer-connected domination numbers of trees
PublikacjaNiech G=(V,E) będzie grafem bez wierzchołków izolowanych. Zbiór wierzchołków D nazywamy zbiorem dominującym totalnym zewnętrznie spójnym jeżli każdy wierzchołek grafu ma sąsiada w D oraz podgraf indukowany przez V-D jest grafem spójnym. Moc najmniejszego zbioru D o takich własnościach nazywamy liczbą dominowania totalnego zewnątrznie spójnego. Praca m.in. zawiera dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego...
-
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...
-
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 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...
-
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 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...
-
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...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
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|...
-
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...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
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...
-
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,...
-
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...
-
The outer-connected domination number of a graph
PublikacjaW pracy została zdefiniowana liczba dominowania zewnętrznie spójnego i przedstawiono jej podstawowe własności.
-
Trees with equal restrained domination and total restrained domination numbers
PublikacjaW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
Total restrained domination numbers of trees
PublikacjaOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
On the total restrained domination number of a graph
PublikacjaW pracy przedstawione są ograniczenia i własności liczby dominowania podwójnie totalnego.
-
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...
-
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...
-
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...
-
Experimental Investigations on the Influence of Coil Arrangement on Melting/Solidification Processes
PublikacjaThe latent heat thermal energy storage units are very popular because of their high energy density and almost close to constant temperature during the charging/discharging. In the present study has been proposed new shell-and-coil geometry with a shifted coil position to enhance the performance of phase change thermal magazine. The experimental investigations have been performed both for the melting and solidification process of...
-
Cross sections calculations for electron scattering from dimethylamine, NH(CH3)2, molecule
PublikacjaThe total cross section for single electron-impact ionization and the integral elastic cross section for electron scattering from dimethylamine have been calculated using the binary-encounter-Bethe model and the independent atom method, respectively.
-
Iterative Global Sensitivity Analysis Algorithm with Neural Network Surrogate Modeling
PublikacjaGlobal sensitivity analysis (GSA) is a method to quantify the effect of the input parameters on outputs of physics-based systems. Performing GSA can be challenging due to the combined effect of the high computational cost of each individual physics-based model, a large number of input parameters, and the need to perform repetitive model evaluations. To reduce this cost, neural networks (NNs) are used to replace the expensive physics-based...
-
Electron-impact ionization cross section of formic acid
PublikacjaExperimental electron-impact ionization cross sections of one of the simplest carboxylic acids, formic acid, are presented. The molecular target was studied in two independent experimental setups applying different methods: the total ion collection and the electron–impact mass spectrometry methods. Experimental data were taken at incident electron energies ranging from ionization threshold [11.31 eV; J.C. Traeger, Int. J. Mass...
-
Abundance and biomass of bacteria in two Arctic glacial fjords
PublikacjaTotal numbers and biomass of bacterioplankton in water in two glacial fjords off west Spitsbergen have been studied. Samples were collected from different water depth layers - from the surface to 80-90 m. Total bacterial number (TBN), biomass and morphological structure were determined by the acridine orange direct count method. The highest values of TBN and biomass in the water column were found on stations situated adjacent...
-
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...
-
Decomposition of Acoustic and Entropy Modes in a Non-Isothermal Gas Affected by a Mass Force
PublikacjaDiagnostics and decomposition of atmospheric disturbances in a planar flow are considered in this work. The study examines a situation in which the stationary equilibrium temperature of a gas may depend on the vertical coordinate due to external forces. The relations connecting perturbations are analytically established. These perturbations specify acoustic and entropy modes in an arbitrary stratified gas affected by a constant...
-
Limiting distribution of Lempel Ziv'78 redundancy
PublikacjaWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
On the Limiting distribution of Lempel Ziv'78 Redundancy for Memoryles Sources
PublikacjaWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
Two-particle entropy and structural ordering in liquid water
PublikacjaEntropies of simple point charge (SPC) water were calculated over the temperature range 278-363 K using the two-particle correlation function approximation. Then, the total two-particle contribution to the entropy of the system was divided into three parts, which we call translational, configurational, and orientational. The configurational term describes the contribution to entropy, which originates from spatial distribution of...
-
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources
PublikacjaWe study the Lempel-Ziv'78 algorithm and show that its (normalized) redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper, in particular, by presenting a new simplified proof of the central limit theorem (CLT) for the number of phrases in the LZ'78 algorithm. We first analyze the asymptotic behavior of the total path length in the associated digital search...
-
Partial dominated schedules and minimizing the total completion time of deteriorating jobs
PublikacjaA problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function pi=ai+bisi, where si is the starting time of the job, ai>=0, bi>=0, for i=1,...,n. Jobs are non-preemptive and independent and there are neither ready times nor deadlines. The goal is to minimize the total weighted completion time. We show how to employ the concept of non-dominated schedules to construct...
-
Low to intermediate energy elastic electron scattering from dichloromethane (CH2Cl2)
PublikacjaWe report a theoretical-experimental investigation of electron scattering by dichloromethane (CH2Cl2) in the low- and intermediate energy ranges. Experimental elastic differential cross sections (DCS), in the incident electron energy range of 0.5-800 eV and scattering angle range of 10°–130°, were measured using a crossed beam relative flow technique. Integral and momentum- transfer cross sections were determined from the experimental...
-
Untargeted Lipidomics Analysis of the Cyanobacterium Synechocystis sp. PCC 6803: Lipid Composition Variation in Response to Alternative Cultivation Setups and to Gene Deletion
PublikacjaCyanobacteria play an important role in several ecological environments, and they are widely accepted to be the ancestors of chloroplasts in modern plants and green algae. Cyanobacteria have become attractive models for metabolic engineering, with the goal of exploring them as microbial cell factories. However, the study of cyanobacterial lipids’ composition and variation, and the assessment of the lipids’ functional and structural...
-
WERYFIKACJA KONCEPCJI PRZEGUBÓW PLASTYCZNYCH PROJEKTOWANYCH NA ODZIAŁYWANIA SEJSMICZNE WIADUKTU V6 OBWODNICY ISTAMBUŁU
PublikacjaW pracy zawarto wyniki analiz betonowego wiaduktu V6 budowanego w ciągu obwodnicy Istambułu w Turcji realizowanego w ramach projektu Northern Marmara Highway. Przeprawę stanowią dwie niezależne nitki o skrzynkowym przekroju poprzecznym i szerokości 22,00 m. Schemat statyczny obiektu to belka dziewięcioprzęsłowa o długości całkowitej 446,86 m oparta na podporach słupowych o zmiennej sztywności (rys.1) i wysokościach zmieniających...
-
Daylighting Education in Practice Verification of a new goal within a European knowledge investigation
PublikacjaTwo independent surveys were conducted in 2017 and in 2018 among architecture students across Europe to investigate their knowledge on daylighting and the impact of that knowledge on the visual perception of daylit spaces. A total of 600 responders were involved. This paper presents findings from the second survey, which was distributed in six European countries. Based on the findings from the first survey, a new goal was set for...
-
Non-volatile molecular composition and discrimination of single grape white of chardonnay, riesling, sauvignon blanc and silvaner using untargeted GC–MS analysis
PublikacjaThis study developed and applied a GC–MS method aiming at molecular fingerprinting of 120 commercial single grape white wines (Chardonnay, Riesling, Sauvignon Blanc and Silvaner) for possible authentication according to grape variety. The method allowed detection of 372 peaks and tentative identification of 146 metabolites including alcohols, organic acids, esters, amino acids and sugars. The grape variety effect explained 8.3%...
-
Association of Genes Related to Oxidative Stress with the Extent of Coronary Atherosclerosis
PublikacjaOxidative stress is believed to play a critical role in atherosclerosis initiation and progression. In line with this, in a group of 1099 subjects, we determined eight single nucleotide polymorphisms (SNPs) related to oxidative stress (PON1 c.575A>G, MPO c.463G>A, SOD2 c.47T>C, GCLM c.590C>T, NOS3 c.894G>T, NOS3 c.786T>C, CYBA c.214C>T, and CYBA c.932A>G) and assessed the extent of atherosclerosis in coronary arteries based on...
-
System of monitoring of the Forest Opera in Sopot structure and roofing
PublikacjaThe authors present a solution realized in Forest Opera (name in Polish: Opera Leśna) in Sopot (Poland) in connection with the modernization and construction of a new roof. The complicated structure of the roof of the facility and the used covering in form of membrane made of technical fabric required (for security reasons) to install the unit of devices allowing for the continuous geodetic monitoring of the facility. Monitoring...
-
Studies on formation and percolation in ionic liquids/TX-100/water microemulsions
PublikacjaTernary microemulsion systems of H2O/Triton X-100/[BMIM][Tf2N], and H2O/Triton X-100/[BMIM][PF6] were prepared, compared and characterized for phase behavior for different water/surfactant ratios, at 25 °C. It was found that a change of an anion structure in the ionic liquids determines the total monophasic area of the systems. A liquid crystalline mesophase was detected in H2O/Triton X-100/[BMIM][PF6]. The microemulsion domains...
-
Size effect in concrete beams under bending – influence of the boundary layer and the numerical description of cracks
PublikacjaIn the paper the size effect phenomenon in concrete is analysed. The results of numerical simulations of using FEM on geometrically similar un-notched and notched concrete beams under bending are presented. Concrete beams of four different sizes and five different notch heights under three-point bending test were simulated. In total 18 beams were analysed. Two approaches were used to describe cracks in concrete. First, eXtended...