Wyniki wyszukiwania dla: NON-ISOLATING 2-BONDAGE
-
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)....
-
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')...
-
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...
-
Conley-Morse graphs for a non-linear Leslie population model with 2 varying parameters
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
An unusual four-nuclear Pb(II)-pyrrole-2-carboxylato polymer: The effect of the lone pair and non-covalent interactions on the supramolecular assembly and fluorescence properties
PublikacjaThe reaction of Pb(NO3)2 with 1H-pyrrole-2-carboxylic acid (2prCOOH) leads to the formation of a new four-nuclear Pb(II) polymer, [Pb4(2prCOO)8(H2O)]n, which has been characterized by CHN, FT-IR, TG, PL and single-crystal X-ray diffraction methods. In view of the primary Pb–O bonds, Pb1 and Pb3 show hemidirected pentagonal pyramidal geometries, while Pb2 and Pb4 display hemidirected octahedral geometries. The topology of the strongest...
-
Bio and slide biobearings, their lubrication by non-newtonian fluids and application in non-conventional systems. Vol. 2, The theory of human joint unsteady lubrication.
PublikacjaW monografii przedstawiono zasady niestacjonarnego smarowania stawów człowieka o odkształcalnych chrząstkach i powierzchniach kostnych w polach indukcji magnetycznej. W opisie stochastycznym uwzględnione zostały nienewtonowskie, lepkosprężyste właściwości cieczy synowialnych jako czynnika smarującego. Monografia prezentuje rozkłady wartości ciśnienia i nośności stawów człowieka w warunkach niestacjonarnego smarowania dla drgań...
-
Virtual screening for small molecular non-covalent binders of the SARS-CoV-2 main protease
Publikacja -
Continuation classes for a non-linear Leslie population model with 2 varying parameters
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Sequential Synthesis of Organosilicon‐Linked 2‐Methoxypyridines by Non‐Cryogenic ortho‐Metallation Using the nBu2TMPMg·Li Reagent and Hydrosilylation
Publikacja -
Marek Czachor prof. dr hab.
Osoby -
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
Regioselective synthesis of novel 4,5-diaryl functionalized 3,4-dihydropyrimidine-2(1H)-thiones via a non-Biginelli-type approach and evaluation of their in vitro anticancer activity
Publikacja -
Morse decompositions for a non-linear Leslie population model with 2 varying parameters
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Jacek Tomków dr hab. inż.
OsobyWykształcenie:1. 2018 r.Doktor inżynier - Politechnika Gdańska, Wydział Mechaniczny, Inżynieria Materiałowa,rozprawa doktorska: Wpływ warunków spawania pod wodą na skłonność do tworzenia pęknięć zimnych w stalach o podwyższonej wytrzymałości 2. 2012 r.Magister inżynier - Politechnika Gdańska, Wydział Mechaniczny, Mechanika i Budowa Maszyn, specjalność: Technologia Maszyn i Komputerowe Wspomaganie Produkcji,praca magisterska: Badania...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
Janusz Smulko prof. dr hab. inż.
OsobyUrodził się 25 kwietnia 1964 r. w Kolnie. Ukończył w 1989 r. z wyróżnieniem Wydział Elektroniki Politechniki Gdańskiej, specjalność aparatura pomiarowa. Zajął II miejsce w konkursie Czerwonej Róży na najlepszego studenta Wybrzeża w 1989 r. Od początku kariery związany z Politechniką Gdańską: asystent (1989–1996), adiunkt (1996–2012), profesor nadzwyczajny PG (od 2012). Odbył staże naukowe w Texas A&M University (2003, NATO...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Dane BadawczeFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...