# Wyniki wyszukiwania dla: 2-OUTER-INDEPENDENT DOMINATION - MOST Wiedzy

## Wyszukiwarka

Wyniki wyszukiwania dla: 2-OUTER-INDEPENDENT DOMINATION
• wyników na stronę:

wszystkich: 77

### Wyniki wyszukiwania dla: 2-OUTER-INDEPENDENT DOMINATION

• #### 2-outer-independent domination in graphs

Publikacja

We 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,...

Pełny tekst w serwisie zewnętrznym

• #### On trees with equal 2-domination and 2-outer-independent domination numbers

Publikacja

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 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...

Pełny tekst w serwisie zewnętrznym

• #### An upper bound on the 2-outer-independent domination number of a tree

Publikacja

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 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) &lt;= (n+l)/2,...

Pełny tekst w serwisie zewnętrznym

• #### On trees with double domination number equal to 2-outer-independent domination number plus one

Publikacja

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 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...

Pełny tekst w serwisie zewnętrznym

• #### On the ratio between 2-domination and total outer-independent domination numbers of trees

Publikacja

A 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...

Pełny tekst w serwisie zewnętrznym

• #### On trees with equal domination and total outer-independent domination numbers

Publikacja

For 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...

• #### Bipartite theory of graphs: outer-independent domination

Publikacja

Let \$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...

Pełny tekst w serwisie zewnętrznym

• #### A lower bound on the double outer-independent domination number of a tree

Publikacja

A 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...

Pełny tekst w serwisie zewnętrznym

• #### A lower bound on the total outer-independent domination number of a tree

Publikacja

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 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) &gt;= (2n-2l+2)/3,...

Pełny tekst w serwisie zewnętrznym

• #### An upper bound on the total outer-independent domination number of a tree

Publikacja

A 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 &gt;= 4, with l leaves and s support vertices we have...

Pełny tekst w serwisie zewnętrznym

• #### An upper bound for the double outer-independent domination number of a tree

Publikacja

A 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...

Pełny tekst w serwisie zewnętrznym

• #### Unicyclic graphs with equal total and total outer-connected domination numbers

Publikacja

- ARS COMBINATORIA - 2015

Let 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...

• #### Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

Publikacja

Given 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...

Pełny tekst w serwisie zewnętrznym

• #### On trees with double domination number equal to 2-domination number plus one

Publikacja

A 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,...

Pełny tekst w serwisie zewnętrznym

• #### Total outer-connected domination in trees

Publikacja

W pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.

Pełny tekst w serwisie zewnętrznym

• #### The outer-connected domination number of a graph

Publikacja

W pracy została zdefiniowana liczba dominowania zewnętrznie spójnego i przedstawiono jej podstawowe własności.

• #### An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree

Publikacja

A 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...

Pełny tekst w serwisie zewnętrznym

• #### Total outer-connected domination numbers of trees

Publikacja

Niech 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...

Pełny tekst w serwisie zewnętrznym

• #### Graphs with equal domination and 2-distance domination numbers

Publikacja

W publikacji scharakteryzowane są wszystkie te drzewa i grafy jednocykliczne, w których liczba dominowania oraz liczba 2-dominowania na odległość są sobie równe.

Pełny tekst w serwisie zewnętrznym

• #### 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

Publikacja

The 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...

Pełny tekst w portalu

• #### Total Domination Versus Domination in Cubic Graphs

A 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...

Pełny tekst w portalu

• #### Total domination in versus paired-domination in regular graphs

Publikacja

A 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...

Pełny tekst w portalu

• #### On trees attaining an upper bound on the total domination number

Publikacja

A 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...

Pełny tekst w serwisie zewnętrznym

• #### All graphs with paired-domination number two less than their order

Publikacja

Let 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...

Pełny tekst w serwisie zewnętrznym

• #### 2-bondage in graphs

Publikacja

A 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') &gt; gamma_2(G). If for every E' subseteq E we have...

Pełny tekst w serwisie zewnętrznym

• #### Bis(diethylamido-[kappa]N)(diethylamine-[kappa]N)bis(2,6-diisopropylphenylamido-[kappa]N)zirconium(IV)

Publikacja

In 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...

Pełny tekst w serwisie zewnętrznym

• #### Non-isolating 2-bondage in graphs

Publikacja

A 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') &gt;= 1 and gamma_2(G-E') &gt; gamma_2(G)....

Pełny tekst w serwisie zewnętrznym

• #### Photoelectron spectroscopy of brominated derivative of pyrimidine: 2-bromopyrimidine

Publikacja

In 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...

Pełny tekst w serwisie zewnętrznym

• #### Some variations of perfect graphs

Publikacja

We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...

Pełny tekst w serwisie zewnętrznym

• #### Towards the boundary between easy and hard control problems in multicast Clos networks

Publikacja

In 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...

Pełny tekst w serwisie zewnętrznym

• #### Amplifying the Randomness of Weak Sources Correlated With Devices

Publikacja

The problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this paper, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition...

Pełny tekst w serwisie zewnętrznym

• #### 5-Selenocyanato and 5-trifluoromethanesulfonyl derivatives of 2′-deoxyuridine: synthesis, radiation and computational chemistry as well as cytotoxicity

Publikacja
• S. Makurat
• M. Zdrowowicz
• L. Chomicz-Mańka
• W. Kozak
• I. Serdiuk
• P. Wityk
• A. Kawecka
• M. Sosnowska
• J. Rak

5-Selenocyanato-2′-deoxyuridine (SeCNdU) and 5-trifluoromethanesulfonyl-2′-deoxyuridine (OTfdU) have been synthesized and their structures have been confirmed with NMR and MS methods. Both compounds undergo dissociative electron attachment (DEA) when irradiated with X-rays in an aqueous solution containing a hydroxyl radical scavenger. The DEA yield of SeCNdU significantly exceeds that of 5-bromo-2′-deoxyuridine (BrdU), remaining...

Pełny tekst w serwisie zewnętrznym

• #### Lead(II) coordination polymers with imidazole-4- and pyrazole-3-carboxylate isomeric linkers: Structural diversity and luminescence properties

Publikacja
• M. Kowalik
• J. Masternak
• K. Kazimierczuk
• O. Khavryuchenko
• B. Kupcewicz
• B. Barszcz

Using 1H-imidazole-4-carboxylic acid (4imCOOH) and 1H-pyrazole-3-carboxylic acid (3pyrCOOH) coordination polymers [Pb(4imCOO)2(H2O)]n (1) and [Pb2(3pyrCOO)4]n (2) were constructed. Obtained polymers were characterized via FT-IR, X-ray, PL and TG methods. The coordination polyhedron around Pb(II) in 1 is described as distorted pentagonal pyramid with hemidirected coordination sphere (based on DFT calculations). Compound 2 consists...

Pełny tekst w serwisie zewnętrznym

• #### Weakly connected Roman domination in graphs

Publikacja

A 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...

Pełny tekst w serwisie zewnętrznym

• #### A Framework for Searching in Graphs in the Presence of Errors

Publikacja

- 2019

We consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...

Pełny tekst w serwisie zewnętrznym

• #### 3,3'-Dibenzoyl-1,1'-dibenzyl-1,1'-(ethane-1,2-diyl)dithiourea

Publikacja

In the title compound, C32H30N4O2S2, the carbonyl and thiocarbonyl groups are found in a rare synclinal conformation, with an S-C···C-O pseudo-torsion angle of 62.6(2)°. The molecule has Ci = S2 point-group symmetry with a crystallographic center of inversion located in the middle of the ethylene bridge. One of the symmetry-independent phenyl...

Pełny tekst w serwisie zewnętrznym

• #### Applications of semi-definite optimization in quantum information protocols

Publikacja

- 2016

This work is concerned with the issue of applications of the semi-definite programming (SDP) in the field of quantum information sci- ence. Our results of the analysis of certain quantum information protocols using this optimization technique are presented, and an implementation of a relevant numerical tool is introduced. The key method used is NPA discovered by Navascues et al. [Phys. Rev. Lett. 98, 010401 (2007)]. In chapter...

• #### Multiple output CMOS current amplifier

Publikacja

In this paper the multiple output current amplifier basic cell is proposed. The triple output current mirror and current follower circuit are described in detail. The cell consists of a split nMOS differential pair and accompanying biasing current sources. It is suitable for low voltage operation and exhibits highly linear DC response. Through cell devices scaling, not only unity, but also any current gains are achievable. As...

Pełny tekst w serwisie zewnętrznym

• #### Molecular basis of lipopolysaccharide heterogeneity in Escherichia coli: envelope stress-responsive regulators control the incorporation of glycoforms with a third 3-deoxy-α-D-manno-oct-2-ulosonic acid and rhamnose.

Publikacja

Mass spectrometric analyses of lipopolysaccharide (LPS) from isogenic Escherichia coli strains with nonpolar mutations in the waa locus or overexpression of their cognate genes revealed that waaZ and waaS are the structural genes required for the incorporation of the third 3-deoxy-α-D-manno-oct-2-ulosonic acid (Kdo) linked to Kdo disaccharide and rhamnose, respectively. The incorporation of rhamnose requires prior sequential incorporation...

Pełny tekst w serwisie zewnętrznym

• #### Design and characterization of apatite La9.8Si5.7Mg0.3O26±δ-based micro-tubular solid oxide fuel cells

Publikacja

- JOURNAL OF POWER SOURCES - 2020

In this study, electrolyte-supported (Cell A) and anode-supported (Cell B) micro-tubular solid oxide fuel cells (SOFCs) based on the La9.8Si5.7Mg0.3O26±δ (LSMO) electrolyte is built through an extrusion and dip-coating processes. The formulations and process conditions for these cells are established and optimized. Both cell configurations show no visible delamination or cracking, and reaction zones and inter-diffusion of any species...

Pełny tekst w serwisie zewnętrznym

• #### Innowacja urbanistyczna w kontekście kształtowania środowiska mieszkaniowego

Publikacja

.

Pełny tekst w serwisie zewnętrznym

• #### On Design Optimization of Miniaturized Microscrip Dual-Band Rat-Race Coupler with Enhanced Bandwidth

Publikacja

- 2016

In the paper, a novel topology of a miniaturized wideband dual-band rat-race coupler has been presented. Small size of the circuit has been obtained by meandering transmission lines of the conventional circuit. At the same time, the number of independent geometry parameters has been increased in order to secure sufficient circuit flexibility in the context of its design optimization for dual-band operation. Optimum dimensions of...

• #### Wybrane metody diagnostyki łożysk silników indukcyjnych oparte o pomiar prądu

Publikacja

W artykule zawarto przegląd wybranych metod diagnostyki łożysk silnika indukcyjnego, bazujących na pomiarach prądu zasilającego. Jedno z nowych rozwiązań przetwarzania sygnałów zostało zaadaptowane przez autorów do stosowanego przez nich systemu diagnostycznego. Wyniki wstępnych badań symulacyjnych zweryfikowanych badaniami na rzeczywistym obiekcie wskazują, że rozwiązanie to ułatwia diagnozowanie. Autorzy zamierzają prowadzić...

• #### Culturable bacteria community development in postglacial soils of Ecology Glacier, King George Island, Antarctica

Publikacja
• M. Zdanowski
• M. Żmuda-Baranowska
• P. Borsuk
• A. Świątecki
• D. Górniak
• D. Wolicka
• K. Jankowska
• J. Grzesiak

- POLAR BIOLOGY - 2012

Glacier forelands are excellent sites in which to study microbial succession because conditions change rapidly in the emerging soil. Development of the bacterial community was studied along two transects on lateral moraines of Ecology Glacier, King George Island, by culture-dependent and culture-independent approaches (denaturating gradient gel electrophoresis). Environmental conditions such as cryoturbation and soil composition...

Pełny tekst w serwisie zewnętrznym

• #### Posttraumatic Orbital Emphysema: A Numerical Model

Publikacja

- Journal of Ophthalmology - 2014

Orbital emphysema is a common symptom accompanying orbital fracture. The pathomechanism is still not recognized and the usually assumed cause, elevated pressure in the upper airways connected with sneezing or coughing, does not always contribute to the occurrence of this type of fracture. Observations based on the finite model (simulating blowout type fracture) of the deformations of the inferior orbital wall after a strike in...

Pełny tekst w serwisie zewnętrznym

• #### Characterization of single-stranded DNA-binding proteins from the psychrophilic bacteria Desulfotalea psychrophila, Flavobacterium psychrophilum, Psychrobacter arcticus, Psychrobacter cryohalolentis, Psychromonas ingrahamii, Psychroflexus torquis, and Photobacterium profundum

Publikacja

- BMC MICROBIOLOGY - 2014

Background: Single-stranded DNA-binding proteins (SSBs) play essential roles in DNA replication, recombination and repair in Bacteria, Archaea and Eukarya. In recent years, there has been an increasing interest in SSBs, since they find numerous applications in diverse molecular biology and analytical methods. Results: We report the characterization of single-stranded DNA-binding proteins from the psychrophilic bacteria Desulfotalea...

Pełny tekst w serwisie zewnętrznym

• #### High prevalence of Escherichia coli belonging to the B2+D phylogenetic group in inflammatory bowel disease

Publikacja

- GUT - 2007

BACKGROUND: It is not clear which species of bacteria may be involved in inflammatory bowel disease (IBD). One way of determining which bacteria might be likely candidates is to use culture-independent methods to identify microorganisms that are present in diseased tissues but not in controls. AIMS: (1) To assess the diversity of microbial communities of biopsy tissue using culture-independent methods; (2) to culture the bacteria...

Pełny tekst w serwisie zewnętrznym

• #### Synthesis, crystal structure and cytotoxic activity of ruthenium(II) piano-stool complex with N,N-chelating ligand

Publikacja
• P. Rogala
• A. Jabłońska-Wawrzycka
• K. Kazimierczuk
• A. Borek
• A. Błażejczyk
• J. Wietrzyk
• B. Barszcz

A mononuclear compound of the general formula [(η6-p-cymene)RuIICl(2,2′-PyBIm)]PF6 has been synthesized from a bidentate N,N-donor ligand, viz. 2,-(2′-pyridyl)benzimidazole (2,2′-PyBIm) and the corresponding chloro-complex [(η6-p-cymene)Ru(μ-Cl)Cl]2 (precursor). The isolated coordination compound was characterized by IR, UV–vis and 1H, 13C NMR spectroscopies. The single crystal X-ray analysis of the complex reveals that the asymmetric...

Pełny tekst w serwisie zewnętrznym

• #### A structure and design optimization of novel compact microscrip dual-band rat-race coupler with enhanced bandwidth

Publikacja

In the letter, a topology of a novel compact wideband dual-band rat-race coupler has been presented along with its computationally efficient design optimization procedure. Reduction of the circuit size has been achieved by meandering transmission lines of the conventional circuit. At the same time, the number of independent geometry parameters has been increased so as to secure sufficient flexibility of the circuit, necessary in...

Pełny tekst w serwisie zewnętrznym

• #### Chronographic Imprint of Age-Induced Alterations in Heart Rate Dynamical Organization

Publikacja
• D. Makowiec
• D. Wejer
• A. Kaczkowska
• M. Żarczyńska-Buchowiecka
• Z. Struzik

- Frontiers in Physiology - 2015

Beat-to-beat changes in the heart period are transformed into a network of increments between subsequent RR-intervals, which enables graphical descriptions of short-term heart period variability. Three types of such descriptions are considered: (1) network graphs arising from a set of vertices and directed edges, (2) contour plots of adjacency matrices A, representing the networks and transition matrices T, resulting from A, and (3)...

Pełny tekst w serwisie zewnętrznym