Filtry
wszystkich: 2120
wybranych: 1685
-
Katalog
- Publikacje 1685 wyników po odfiltrowaniu
- Czasopisma 3 wyników po odfiltrowaniu
- Osoby 30 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 18 wyników po odfiltrowaniu
- Wydarzenia 22 wyników po odfiltrowaniu
- Dane Badawcze 359 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: double domination
-
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...
-
Weakly connected domination stable trees [online]
PublikacjaPraca dotyczy pełnej charakteryzacji drzew stabilnych ze względu na liczbę dominowania słabo spójnego.
-
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)....
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
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...
-
Graphs with convex domination number close to their order
PublikacjaW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
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.
-
A note on the weakly convex and convex domination numbers of a torus
PublikacjaW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
Lower bound on the weakly connected domination number of a tree
PublikacjaPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Block graphs with large paired domination multisubdivision number
PublikacjaThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Lower bound on the distance k-domination number of a tree
PublikacjaW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Domination numbers in graphs with removed edge or set of edges
PublikacjaW artykule przedstawiony jest wpływ usuwania krawędzi lub zbioru krawędzi na liczby dominowania spójnego i słabo spójnego.
-
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...
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublikacjaPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
Idelalisib or placebo in combination with bendamustine and rituximab in patients with relapsed or refractory chronic lymphocytic leukaemia: interim results from a phase 3, randomised, double-blind, placebo-controlled trial
Publikacja -
Double Fed Induction Machine Drives
PublikacjaContents of the Chapter 22:Machine model.Properties of the DFM.Steady state machine operation.Control rules and decoupled control.Decoupling based on MM machine model.Decoupling based on vector model.Decoupling based on rotor current equation.Overall control system.Control system based on MM model.Control system based on vector model.Estimation of variables.Calculation of the angle between stator and rotor.Remarks about digital...
-
Dissociative photo-double-ionization of isoxazole
PublikacjaIn the present communication, we present results on the photo-double-ionization and fragmentation of the isoxazole molecules. The experiments were carried out at the CiPo beamline at the Elettra-Sincrotrone radiation facility exploiting the VUV excitation and the ion time-of-flight spectrometry combined with the PEPICO technique. The dissociative processes where only one electron is emitted are quite well known [1]. However, double...
-
Damage repair of the double shell tank
PublikacjaPłaszcz wewnętrzny stalowego zbiornika dwupłaszczowego o pojemności 10000 m3 został zdeformowany w wyniku błędu popełnionego podczas próby wodnej przy odbiorze zbiornika. W referacie omówiono technologię naprawy silnie zdeformowanego płaszcza zbiornika. Stosowano roztłaczanie hydrauliczne, prostowanie mechaniczne i termiczne oraz wymianę najbardziej uszkodzonych blach.
-
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...
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublikacjaArtykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.
-
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...
-
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}...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
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.
-
A double-talk detector using audio watermarking
Publikacjaa novel approach to double-talk detection in the acoustic echo canceler is proposed. a hidden signature is embedded into the arriving signal, using the echo-hiding method. next detection of the presence of this signature in the microphone signal is performed. the results of the signature detection may be used by the acoustic echo canceler to stop or restart the adaptation process.
-
The Double Cognitive Bias of Mistakes: A Measurement Method
PublikacjaThere is no learning without mistakes. However, making mistakes among knowledge workers is s�ll seeing shameful. There is a clash between posi�ve a�tudes and beliefs regarding the power of gaining new (tacit) knowledge by ac�ng in new contexts and nega�ve a�tudes and beliefs toward accompanying mistakes that are sources of learning. These contradictory a�tudes create a bias that is doubled by the other shared solid belief...
-
A comprehensive approach to double inverted pendulum modelling
PublikacjaThe problem of mathematical modelling and indication of properties of a DIP has been investigated in this paper. The aim of this work is to aggregate the knowledge on a DIP modelling using the Euler-Lagrange formalism in the presence of external forces and friction. To indicate the main properties important for simulation, model parameters identification and control system synthesis, analytical and numerical tools have been used....
-
Stabilization of the pyrochlore phase of Mn2Sb2O7 by double substitution
PublikacjaPolycrystalline samples of (Ce4+Mn2+3)(Ga3+Sb5+3)O14 were synthesized by a high-temperature solid-state reaction. In contrast with the parent Mn2Sb2O7 compound that adopts a rhombohedral or monoclinic structure at T > 600 °C, the pyrochlore structure of CeMn3GaSb3O14 is retained up to at least T = 1070°C. High-resolution synchrotron x-ray diffraction measurements show no sign of a superstructure or distortion from cubic symmetry...
-
Noise in electrical double-layer capacitors (EDLCs)
PublikacjaWe present methods and problems of noise measurements in electrical double-layer capacitors (EDLC). Detailed noise equivalent electronic circuit is considered, and two possible ways of observations of random processes generated in the EDLCs structures are studied. We conclude that noise is a useful tool for characterization of the EDLC structures and their state-of-health, as in other materials and electronic devices. Eventual,...
-
On asymptotic periodicity of kernel double Markovian operators
PublikacjaIt is proved that a kernel, doubly Markovian operator T is asymptotically periodic if and only if its deterministic σ-field Σd(T)(equivalently Σd(T∗)) is finite. It follows that kernel doubly Markovian operator T is asymptotically periodic if and only if T∗ is asymptotically periodic.
-
Dissociative photo-double-ionization of the isoxazole molecules
PublikacjaThe five-membered heterocyclic rings are incorporated into a wide variety of structures that play a vital role in many biochemical processes. In particular, the isoxazole molecule appears in many bioactive compounds due to its unique ring structure that consists of one oxygen atom and one nitrogen atom at adjacent positions. The unique atomic composition and bond arrangement of isoxazole imply its specific electronic properties...
-
Wideband crossover structure with double ring resonators
PublikacjaThe structure of a four-port microstrip crossover is presented. The device is composed of two ring resonators, one circular and one built from meander lines, connected by four straight lines. The equivalent circuit model of the crossover is derived. The structure is designed on thin and flexible substrate to allow it to bend. The possibility of applying the device on curved surfaces is tested experimentally.
-
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...
-
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...
-
All graphs with restrained domination number three less than their order
PublikacjaW pracy opisana jest rodzina wszystkich grafów, dla których liczbadominowania zewnętrznego jest o trzy mniejsza od ich rzędu.
-
Anterior Cruciate Ligament Reconstruction Using a 4-Strand Semitendinosus Tendon Graft or a Doubled Semitendinosus and Gracilis Tendon Graft: A 4.5-Year Prospective, Randomized, Double-Blind, Parallel-Group Study
Publikacja -
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...
-
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.
-
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...
-
Myeloid-derived suppressor cells: a double-edged sword?
Publikacja -
Reactions of parylenes with double bonds: An ab initio study
Publikacja -
Double-Headed Cationic Lipopeptides: An Emerging Class of Antimicrobials
Publikacja -
Structure and electric properties of double magnesium zirconium orthophosphate
PublikacjaPublikacja przedstawia wyniki pomiarów elektrycznych i strukturalnych ortofosforanu magnezowo-cyrkonowego.
-
Wear of the tool in double-disc lapping of silicon wafers
PublikacjaPrzedstawiono założenia modelowe do określania zużycia narzędzia w docieraniu krzemowych płytek półprzewodnikowych. Obliczenia zostały wykonane dla różnych parametrów kinematycznych, wpływających na zużycie narzędzia w określonych jego obszarach.
-
Synthesis and properties of the double perovskites La2NiVO6, La2CoVO6, and La2CoTiO6
Publikacja -
Double-ridged horn antenna with sinusoidal ridge profile
PublikacjaPrzedstawiono wyniki symulacji numerycznej oraz pomiarów parametrów anteny tubowej z podwójnym grzbietem. Badania numeryczne dotyczyły zarówno samego układu zasilania falowodu grzbietowego jak i całej anteny z uwzględnieniem sinusoidalnego profilu impedancji grzbietu. Wyniki obliczeń dopasowania oraz charakterystyk promieniowania, wykonanych przy użyciu symulatora QW-3D, porównano z wynikami pomiarów, stwierdzając dobrą zgodność...