Wyszukiwarka
Filtry
wszystkich: 4570
-
Katalog
- Publikacje 1841 wyników po odfiltrowaniu
- Czasopisma 1 wyników po odfiltrowaniu
- Osoby 93 wyników po odfiltrowaniu
- Wynalazki 5 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Laboratoria 4 wyników po odfiltrowaniu
- Zespoły Badawcze 9 wyników po odfiltrowaniu
- Aparatura Badawcza 48 wyników po odfiltrowaniu
- Kursy Online 404 wyników po odfiltrowaniu
- Wydarzenia 14 wyników po odfiltrowaniu
- Dane Badawcze 2150 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: (1,2)-DOMINATION NUMBER
-
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...
-
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...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe domination subdivision number sd(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 domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
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...
-
On the connected and weakly convex domination numbers
PublikacjaIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
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...
-
The paired-domination and the upper paired-domination numbers of graphs
PublikacjaIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
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...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
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...
-
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”,...
-
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...
-
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}...
-
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.
-
Młode Miasto Gdańsk (1380-1455) i jego patrymonium
PublikacjaW monografii ustalono m.in.: 1) położenie strefy osadniczej Młodego Miasta i zasięg jego patrymonium, 2) liczbę i (w miarę możliwości) lokalizację obiektów sakralnych w tym ośrodku, 3) zmiany w statusie parafialnym kościoła św Bartłomieja, 4) przemiany demograficzne ośrodka młodomiejskiego, 5) związki elity politycznej Młodego Miasta z Głównym Miastem oraz ich kontakty z Zakonem, 6) rolę portu Młodego Miasta jako ośrodka pomocniczego...
-
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...
-
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')...
-
The 2:1 cocrystal of benzamide and pentafluororbenzoic acid
PublikacjaKrystaliczna struktura centrosymetrycznej supermolekuły składa się z czterech cząsteczek benzamidu oraz dwóch kwasu karboksylowego, które powiązane są ze sobą za pomocą wiązań wodorowych typu O-H...O oraz N-H...O.
-
Weakly connected Roman domination in graphs
PublikacjaA 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...
-
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...
-
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|...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Francia 1, 2, 3
Czasopisma -
CZYNNIKI DECYDUJĄCE O PRZYDATNOŚCI KOMPUTEROWEGO MODELU PRZEPŁYWÓW W SIECI WODOCIĄGOWEJ
PublikacjaW pracy poddano analizie wielozadaniowy proces tworzenia komputerowego modelu przepływów. W efekcie zidentyfikowano szereg czynników ograniczających obszar stosowania modelu w praktyce inżynierskiej. W zakresie pozyskiwania danych strukturalnych i operacyjnych wskazano potencjalne źródła błędów, które przyczyniają się do zmniejszenia dokładności odwzorowania stanu rzeczywistego. Specjalną rangę nadano specyfikacji czynników związanych...
-
Nadmiarowe zgony podczas pandemii COVID-19 w Polsce i ocena skuteczności szczepień
PublikacjaZ powodu pandemii COVID-19 zmarły miliony ludzi na całym świecie. Jak wynika z wielu badań, szczepienia przeciw chorobie wywołanej wirusem SARS-CoV-2 okazały się środ-kiem ograniczającym skalę zachorowań i liczbę zgonów. Celem badania omawianego w artyku-le jest pomiar skali pandemii w Polsce za pomocą liczby nadmiarowych zgonów w podregio-nach według klasyfikacji NUTS 3 i w grupach wieku, a następnie określenie zależności pomiędzy...
-
Graphs with equal domination and 2-distance domination numbers
PublikacjaW 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.
-
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.
-
5-Selenocyanato and 5-trifluoromethanesulfonyl derivatives of 2′-deoxyuridine: synthesis, radiation and computational chemistry as well as cytotoxicity
Publikacja5-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...
-
Dichlorido-1Cl,3Cl-hexakis[1,1,2,2,3,3(n5)-methylcyclopentadienyl]di-μ2-oxido-1:2κ2O:O;2:3κ2O:O-trihafnium(IV)
PublikacjaTytułowy związek jest trójrdzeniową cząsteczką. Dwie jednostki (MeCp)2HfCl połączone są z (MeCp)2Hf przez mostki tlenowe. Mostki Hf-O-Hf są prawie liniowe. Geometria trzech atomów Hf jest tetraedryczna.
-
Pressure drop and heat transfer during boiling and condensation at subcritical region
PublikacjaMost of the data presented in the literature relate to saturation temperatures in the range - 20°C to 40°C due to the application in refrigeration technology. There is necessity to extend databases to higher values of saturation temperature due to new applications such as Organic Rankine Cycle and high temperature heat pumps. Only few papers contain data for high reduced pressure for low boiling point liquids. This paper focus...
-
Wiktoria Wojnicz dr hab. inż.
OsobyDSc in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2019 PhD in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2009 (with distinction) Publikacje z listy MNiSW (2009 - ) Wojnicz W., Wittbrodt E., Analysis of muscles' behaviour. Part I. The computational model of muscle. Acta of Bioengineering and Biomechanics, Vol. 11, No.4, 2009, p. 15-21 Wojnicz W., Wittbrodt E.,...
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
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.
-
Preparation of 1-[Ω-(1,4,5,6-Tetrahydropyrimidin-2-yl)alkyl]thymines
PublikacjaOne-stage prepn. of the hydrochloride salts of 1-[ω-(1,4,5,6-tetrahydropyrimidin-2-yl)alkyl]-thymines, e.g. I, from 1-(ω-cyanoalkyl)thymines and a 1:1-mixt. of 1,3-diaminopropane and ethanol satd. with hydrogen sulfide is described. 1-(2-Cyanoethyl)-thymine gave a facile reversal of the Michael reaction to thymine under the conditions used. The reaction of 1,3-bis(3-cyanobenzyl)thymine with the above reagent produced 1,3-bis[3-(1,4,5,6-tetrahydropyrimidin-2-yl)benzyl]thymine.
-
Marek Czachor prof. dr hab.
Osoby -
Scattering of electrons from 1-butene, H2C=CHCH2CH3, and 2-methylpropene,H2C=C(CH3)2, molecules
PublikacjaZmierzono, wykorzystując liniową technikę transmisyjną, całkowite absolutne przekroje czynne (TCS) na rozpraszanie elektronów na cząsteczce 1-butenu (H2C=CHCH2CH3) oraz 2-metylpropene (H2C=C(CH3)2) w zakresie energii padających elektronów, od 1 do 400 eV oraz od 1 do 350 eV. Kształt przekroju czynnego dla obu badanych izomerów butenu jest podobny. Dwie struktury w uzyskanych krzywych TCS, są wyraźnie widoczne: mały pik w okolicy...
-
Synthesis and structural characterization of novel 2-benzimidazolylthioureas: adducts of natural isothiocyanatesand 2-amino-1-methylbenzimidazole
PublikacjaNa drodze syntezy chemicznej uzyskano addukty naturalnych izotiocyjanianów - alilu, benzylu i fenyloetylu i 2-amino-1-metylobenzoimidazolu. W następstwie optymalizacji warunków reakcji, poszczególne 2-benzimidazolilotiomoczniki otrzymano produkty z umiarkowanymi wydajnościami. Strukturę molekularną i krystaliczną produktów scharakteryzowano przy użyciu metod spektroskopowych i X-ray. Analiza uzyskanych widm pozwoliła stwierdzić,...
-
Jacek Tejchman prof. dr hab. inż.
Osoby -
Valence state of Manganium in a MnCoO ceramics
Dane BadawczeManganium -cobalt based ceramics materials were produced by solid state reaction and sintred in a furnance in air atmosphere for 20h. Annealing temperature was 600 Celsius degree. For investigations a series of samples, with a various composition was chosen: MnCoO, Mn, Co2O and Mn2CoO. In order to determine valence states of the Mn, X-Ray photoemission...
-
Krzysztof Jan Kaliński prof. dr hab. inż.
OsobyUkończył studia magisterskie na Wydziale Mechanicznym Technologicznym (MT) PG (1980, dyplom z wyróżnieniem). Stopień doktora otrzymał na Wydziale Budowy Maszyn PG (1988, praca wyróżniona), stopień doktora habilitowanego na Wydziale Mechanicznym (WM) PG (2002, praca wyróżniona), a tytuł profesora nauk technicznych – w 2013 r. Od 2015 r. jest profesorem zwyczajnym, a od 2019 r. - profesorem. Obszar jego badań naukowych obejmuje:...
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Tomasz Gzella mgr inż.
Osoby -
1-(2-Pyridylazo)-2-naphthol as Possible Analytical Reagent
Publikacja -
Persulfates to degrade a mixture of dyes (rhodamine B, methylene blue) in the presence of glucose and visible light
PublikacjaA treatment process utilizing visible-light-activated (Vis) persulfates (PS) in the presence of an organic promoter (glucose) was developed for the simultaneous decolorization of a rhodamine B (RhB) and methylene blue (MB) mixture. Various doses of glucose, PS concentrations, pH values, initial dye concentrations and process time were tested to find out the most appropriate parameters for degrading the RhB/MB mixture in the...
-
Study of Integer Spin S = 1 in the Polar Magnet β-Ni(IO3)2
PublikacjaPolar magnetic materials exhibiting appreciable asymmetric exchange interactions can potentially host new topological states of matter such as vortex-like spin textures; however, realizations have been mostly limited to half-integer spins due to rare numbers of integer spin systems with broken spatial inversion lattice symmetries. Here, we studied the structure and magnetic properties of the S = 1 integer spin polar magnet β-Ni(IO3)2...
-
Distribution and bioavailability of mercury in the surface sediments of the Baltic Sea
PublikacjaThe study aimed to determine the level of mercury (Hg) and its labile and stable forms in the surface sediments of the Baltic Sea. The work considers the impact of current and historical sources of Hg on sediment pollution, together with the influence of different environmental parameters, including water inflows from the North Sea. Surface sediments (top 5 cm) were collected in 2016–2017 at 91 stations located in different...
-
Algebraic periods and minimal number of periodic points for smooth self-maps of 1-connected 4-manifolds with definite intersection forms
PublikacjaLet M be a closed 1-connected smooth 4-manifolds, and let r be a non-negative integer. We study the problem of finding minimal number of r-periodic points in the smooth homotopy class of a given map f: M-->M. This task is related to determining a topological invariant D^4_r[f], defined in Graff and Jezierski (Forum Math 21(3):491–509, 2009), expressed in terms of Lefschetz numbers of iterations and local fixed point indices of...
-
Optimization of Chemical Functionalities of Indole-2-carboxamides To Improve Allosteric Parameters for the Cannabinoid Receptor 1 (CB1)
Publikacja5-Chloro-3-ethyl-N-(4-(piperidin-1-yl)phenethyl)-1H-indole-2-carboxamide (1; ORG27569) is a prototypical allosteric modulator for the cannabinoid type 1 receptor (CB1). Here, we reveal key structural requirements of indole-2-carboxamides for allosteric modulation of CB1: a critical chain length at the C3-position, an electron withdrawing group at the C5-position, the length of the linker between the amide bond and the phenyl ring...