Filtry
wszystkich: 2588
wybranych: 1957
-
Katalog
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: Y-DOMINATING SET
-
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,...
-
Processing and properties of Al-Si-Fe-Cr in situ composites
PublikacjaPraca jest kontynuacją badań nad wytwarzaniem tanich kompozytów in situ o osnowie stopu Al-Si wzmocnionego związkami międzymetalicznymi Al-Fe-Si lub Al-Fe-Cr-Si, otrzymanych poprzez reakcję ciekłego stopu Al (Al-Si11, Al-Si25) z proszkiem Fe lub Cr. Żelazo zostało wybrane ze względu na niską cenę, niską temperaturę wytwarzania, wysoką reaktywność z Al i heksagonalną sieć krystalograficzną związku Al-Fe-Si, co sprzyja tworzeniu...
-
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,...
-
Financial impact analysis of going public at the Warsaw Stock Exchange: Using Fuzzy Set Theory to understand behaviours of mature companies
Publikacja -
Softly switched robustly feasible mpc for constrained linear systems under set bounded uncertainty- LQ-MPC with IC action
PublikacjaNie jest możliwe efektywne sterowanie procesem w szerokim zakresie zmian warunków operacyjnych przy użyciu jednego uniwersalnego regulatora. W pracy zaproponowano koncepcję sposobu regulacji polegającego na przełączaniu wielu regulatorów uzależnionego od stanu operacyjnego systemu. Często twarde przełączanie regulatorów nie jest pożądane lub wręcz możliwe, alternatywą jest ich miękkie przełączanie. W pracy rozważany jest problem...
-
GRAPHICAL REPRESENTATION OF MUSIC SET BASED ON MOOD OF MUSIC. GRAFICZNA PREZENTACJA ZBIORU MUZYCZNEGO OPARTA NA ANOTACJI NASTROJU MUZYKI
PublikacjaOne of the features for music recommendation, which is useful and intuitive for music listen-ers, is “mood”. The paper presents an approach to graphical representation of mood of music pieces. Subjective evaluation based on listening tests is performed for assigning mood labels of 150 pieces of music and placing them on the 2D mood plane. As a result, a map of songs is created, where music excerpts with similar mood are organized...
-
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...
-
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 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...
-
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...
-
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...
-
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...
-
Investigation of cationic distribution, Y–K angles, and optical and dielectric properties of as-synthesized cerium-doped cobalt nano-ferrites prepared by co-precipitation method
Publikacja -
Natural/bio-based sorbents as greener extractive materials for endocrine disrupting compounds in samples of different matrix composition
PublikacjaEndocrine-disrupting compounds (EDCs) are a group of chemicals that interfere with the endocrine system, leading to adverse effects on human health and the environment. Increasing concerns over the EDCs presence in various environmental compartments has driven the search for greener extraction materials. Recently, the use of polymers of natural origin (biopolymers) has been demonstrated to be an effective and promising research...
-
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...
-
Dirac fermions and possible weak antilocalization in LaCuSb2
PublikacjaLayered heavy-metal square-lattice compounds have recently emerged as potential Dirac fermion materials due to bonding within those sublattices. We report quantum transport and spectroscopic data on the layered Sb square-lattice material LaCuSb2. Linearly dispersing band crossings, necessary to generate Dirac fermions, are experimentally observed in the electronic band structure observed using angle-resolved photoemission spectroscopy,...
-
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...
-
ЯКІСТЬ МЕДИЧНИХ ПОСЛУГ: ЕКОНОМІЧНА СУТНІСТЬ ТА ІНТЕРПРЕТАЦІЯ
Publikacja -
TRANSFORMATION OF DIGITALIZATION ON THE FINANCIAL AND INSURANCE MARKET
Publikacja -
Implementation mechanism of impact investing in the post-conflict regions
Publikacja -
Numerical solution of threshold problems in epidemics and population dynamics
PublikacjaA new algorithm is proposed for the numerical solution of threshold problems in epidemics and population dynamics. These problems are modeled by the delay-differential equations, where the delay function is unknown and has to be determined from the threshold conditions. The new algorithm is based on embedded pair of continuous Runge–Kutta method of order p = 4 and discrete Runge–Kutta method of order q = 3 which is used for the...
-
The Effect of Cryogenic Treatment on Microstructure and Mechanical Response of AISI D3 Tool Steel Punches
PublikacjaRecently, deep cryogenic treatment is performed to improve the mechanical responses (wear, hardness, fatigue, and thermal conductivity) of various steel components. Researchers have tried to evaluate the eco-friendly and nontoxic process to optimize the parameters. Cold-shearing punches used to manufacture various holes that undergo severe impact loading and wear in the metal forming process. This study concerns the effect of soaking...
-
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...
-
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}...
-
Correction to: Investigation of cationic distribution, Y–K angles, and optical and dielectric properties of as-synthesized cerium-doped cobalt nano-ferrites prepared by co-precipitation method
Publikacja -
Ekspertyza konstrukcji i stanu technicznego napędu rollera rejowego, napędu rollera sztagowego oraz wózka fałowego na sztag s/y "Running on Waves"
PublikacjaCelem ekspertyzy było ustalenie przyczyn nieprawidłowej pracy urządzeń rejowych i wciągarek. Omówiono błędy projektowe i wykonawcze oraz wskazano przyczyny awarii. Sformułowano wnioski dotyczące kierunków modernizacji konstrukcji.
-
Effectiveness of either short-duration ischemic pre-conditioning, single-set high-resistance exercise, or their combination in potentiating bench press exercise performance
Publikacja -
Simultaneous determination of hydrophobicity and dissociation constant for a large set of compounds by gradient reverse phase high performance liquid chromatography–mass spectrometry technique
Publikacja -
Effects of Acute Caffeine Intake on Power Output and Movement Velocity During a Multiple-Set Bench Press Exercise Among Mild Caffeine Users
Publikacja -
Zagospodarowanie ciepła odpadowego z biogazowych agregatów kogeneracyjnych w oczyszczalni ścieków = Waste heat utilisation from cogeneration set in sewage plant
PublikacjaW pracy opisano koncepcję współpracy biogazowych modułów kogeneracyjnych z niskotemperaturowym obiegiem parowym. Proponowana modernizacja pozwoliłaby na wykorzystanie entalpii fizycznej spalin, tym samym zwiększając sprawność urządzeń wytwarzających ciepło i energię elektryczną. Tego typu rozwiązanie umożliwiłoby częściowe pokrycie zapotrzebowania własnego na energię elektryczną, generując oszczędności w przedsiębiorstwie. W artykule...
-
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)....
-
30-day morbidity and mortality of sleeve gastrectomy, Roux-en-Y gastric bypass and one anastomosis gastric bypass: a propensity score-matched analysis of the GENEVA data
Publikacja -
The use of Yttrium-90 Ibritumomab Tiuxetan ( 90 Y-IT) as a consolidation therapy in high-risk patients with diffuse large B-cell lymphoma ineligible for autologous stem-cell transplantation
Publikacja -
Political extremism, group membership and personality traits: who accepts violence? / Extremismo político, pertenencia al grupo y rasgos de personalidad: ¿Quién acepta la violencia?
Publikacja -
Utility of Inflammatory Markers in Detection of Perioperative Morbidity After Laparoscopic Sleeve Gastrectomy, Laparoscopic Roux-en-Y Gastric Bypass, and One-Anastomosis Gastric Bypass—Multicenter Study
Publikacja -
Mutual Interaction between Temperature and DO Set Point on AOB and NOB Activity during Shortcut Nitrification in a Sequencing Batch Reactor in Terms of Energy Consumption Optimization
PublikacjaRecently, many wastewater treatment plants (WWTPs) have had to deal with serious problems related to the restrictive requirements regarding the euent quality, as well as significant energy consumption associated with it. In this situation, mainstream deammonification and/or shortened nitrification-denitrification via nitrite (so-called “nitrite shunt”) is a new promising strategy. This study shows the mechanisms and operating conditions...
-
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...
-
SU‐GG‐T‐357: Initial Evaluation of a Fast Optical CT Scanner for Gel Dosimetry
Publikacja -
SU‐GG‐T‐290: A Fast Optical CT Scanner for Gel Dosimetry
Publikacja -
Radiation dose distributions in three dimensions from tomographic optical density scanning of polymer gels: II. Optical properties of the BANG polymer gel
Publikacja -
Ab initio studies of phonons in MgO by the direct method including LO mode
Publikacja -
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...
-
Luminescent properties of Tb and Eu activated AxB1-xAlO3 (A = Y, Lu, Gd; B = Lu; x = 0, 0.5, 1) mixed oxides crystals prepared by micro-pulling-down method
Publikacja -
The influence of synthesis method on the microstructure and catalytic performance of Y 0.07 Sr 0.93 Ti 0.8 Fe 0.2 O 3-δ in synthetic biogas operated solid oxide fuel cells
PublikacjaThe Y0.07Sr0.93Ti0.8Fe0.2O3-δ (YSTF) material was fabricated using three different synthesis methods: modified polymer precursor method (MPP), Pechini method and a solid state reaction method. It was applied as an anode catalytic material for biogas reforming in solid oxide fuel cells. Clear differences in the microstructure of fabricated catalytic layers were found, mainly with respect to a grain size and distribution of grains....
-
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...
-
A novel dual mode capacitor biosensor for real-time, label-free DNA detection
Publikacja -
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')...
-
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)....