Wyszukiwarka
Filtry
wszystkich: 9725
-
Katalog
- Publikacje 4808 wyników po odfiltrowaniu
- Czasopisma 12 wyników po odfiltrowaniu
- Osoby 155 wyników po odfiltrowaniu
- Wynalazki 11 wyników po odfiltrowaniu
- Projekty 10 wyników po odfiltrowaniu
- Laboratoria 6 wyników po odfiltrowaniu
- Zespoły Badawcze 9 wyników po odfiltrowaniu
- Aparatura Badawcza 49 wyników po odfiltrowaniu
- Kursy Online 1437 wyników po odfiltrowaniu
- Wydarzenia 57 wyników po odfiltrowaniu
- Dane Badawcze 3171 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: G/G/1
-
The role of selected metalloproteinases in cheiroarthropathy in children with type 1 diabetes - a pilotage study
Publikacja -
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
[Rozdział] 1. Metale ciężkie w środowisku jako problem ogólnoeuropejski
PublikacjaMetale ciężkie stanowią poważne zagrożenie środowiska ze względu na ich toksyczne oddziaływanie na poszczególne elementy środowiska i bioakumulację w łańcuchu pokarmowym zwierząt i ludzi. Celem pracy jest przedstawienie zanieczyszczenia środowiska rtęcią, ołowiem i kadmem jako problemu o znaczeniu ogólnoeuropejskim, a nie ważnym tylko w skali lokalnej. Metale ciężkie emitowane do atmosfery w jednej części Europy są transportowane...
-
T-colorings, divisibility and circular chromatic number
PublikacjaLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Conversion of waste biomass to designed and tailored activated chars with valuable properties for adsorption and electrochemical applications
PublikacjaWaste biomass, a renewable energy source, is inexpensive material that has great potential in sorp-tion and electrochemical application. The selected waste materials (corncobs, coconut shells, wal-nuts, and pistachio husks) allow to close the production cycle and enable material recycling, which are important aspects in the hierarchy of waste management. The proposed methodology for pro-duction and activation of biochars can be...
-
Evaluation of Langmuir and Freundlich Isotherms for Removal of Cephalexin and Tetracycline Antibiotics By Sistan Sand from Water and Wastewater Samples
PublikacjaIn this research, Sistan sand was used as a natural and inexpensive sorbent for removal of cephalexin and tetracycline antibiotics from water and wastewater samples. For a concentration 60.0 mg L-1 of cephalexin, optimum removal conditions were: pH of the sample 3.0, adsorbent amount 1.0 g, contact time 20.0 min, added amount of sodium chloride to adjust the ionic strength of the solution 7.0 g L-1. Langmuir isotherm was the best...
-
New potential functions for greedy independence and coloring
PublikacjaA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Graph classes generated by Mycielskians
PublikacjaIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
On the size of identifying codes in triangle-free graphs
PublikacjaIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA 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...
-
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...
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublikacjaIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
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.
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
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...
-
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...
-
Regularity of weak solutions for aclass of elliptic PDEs in Orlicz-Sobolev spaces
PublikacjaWe consider the elliptic partial differential equation in the divergence form $$-\div(\nabla G(\nabla u(x))) t + F_u (x, u(x)) = 0,$$ where $G$ is a convex, anisotropic function satisfying certain growth and ellipticity conditions We prove that weak solutions in $W^{1,G}$ are in fact of class $W^{2,2}_{loc}\cap W^{1,\infty}_{loc}$.
-
The Potential of Greed for Independence
PublikacjaThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Miscanthus × giganteus root anatomical traits measurements
Dane BadawczeThis data set presents the optical microscope measurements/ images of Miscanthus × giganteus (M×g) roots. The experiment was performed under work package 1: "Properties characterisation of two types of biochar", task D_RT: Phyto-analyses (stress response of plants on biochar amendments) in cooperation with Aarhus University. A short term pot experiment...
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
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...
-
Silicon oxycarbide-tin nanocomposite derived from a UV crosslinked single source preceramic precursor as high-performance anode materials for Li-ion batteries
PublikacjaIn this work, we report an innovative and facile UV light-assisted synthesis of a nanocomposite based on silicon oxycarbide (SiOC) and tin nanoparticles. SiOC ceramic matrix, containing a conductive free carbon phase, participates in lithium-ion storage, and buffers the volume changes of Li-alloying/de-alloying material. The reported synthesis procedure through a polymer-derived ceramic route involves the preparation of a single-source...
-
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)....
-
Photocatalytic activity of zinc oxide nanorods incorporated graphitic carbon nitride catalyst
PublikacjaBackground Photocatalysts are user-friendly and serve as compatible materials for degrading industrial dye pollutants. This study utilizes zinc oxide/graphitic carbon nitride (ZnO/g-C3N4) nanocomposites against degrading methylene blue (MB). Methods The hydrothermal method assisted sonication technique was used to fabricate the ZnO/g-C3N4 composite with varying ratios of ZnO/g-C3N4 (1:0.25, 1:0.50, 1:1). The synthesized materials...
-
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...
-
Fungal co-culture improves the biodegradation of hydrophobic VOCs gas mixtures in conventional biofilters and biotrickling filters
PublikacjaThe present study systematically evaluated the potential of Candida subhashii, Fusarium solani and their consortium for the abatement of n-hexane, trichloroethylene (TCE), toluene and α-pinene in biofilters (BFs) and biotrickling filters (BTFs). Three 3.2 L BFs packed with polyurethane foam and operated at a gas residence time of 77 s with an air mixture of hydrophobic volatile organic compounds (VOCs) were inoculated with C. subhashii,...
-
Generation-recombination and 1/f noise in carbon nanotube networks
PublikacjaThe low-frequency noise is of special interest for carbon nanotubes devices, which are building blocks for a variety of sensors, including radio frequency and terahertz detectors. We studied noise in as-fabricated and aged carbon nanotube networks (CNNs) field-effect transistors. Contrary to the majority of previous publications, as-fabricated devices demonstrated the superposition of generation-recombination (GR) and 1/f noise...
-
Optimal backbone coloring of split graphs with matching backbones
PublikacjaFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
Measurements of inelastic electron scattering from molecular oxygen at high scattering angles
PublikacjaBadano procesy wzbudzenia oscylacyjnego poziomów v = 1-9 stanu podstawowego X3 sigma g oraz v=0 stanu wzbudzonego a1 delta g cząsteczki tlenu dla energii 10eV w przedziale kąta rozproszenia od 90 do 180 st. Dla pomiaru v=1 stanu X3 sigma g wyznaczono różniczkowy przekrój czynny na wzbudzenie. W pomiarach wykorzystano podwójny hemisferyczny spektrometr elektrostatyczny wykorzystujący nowozaprojektowane źródło lokalnego pola magnetycznego.
-
In situ transformation boosts the pseudocapacitance of CuNi-MOF via cooperative orientational and electronic governing
PublikacjaThe disordered arrangement and thereof inferior conductivity of 2D MOF sheets seriously hinder their practical application. Herein, we propose in situ transformation strategy to architect vertically oriented bimetallic CuNi-MOF as a self-supporting electrode, leading to a decuple high specific capacitance of 1262 C g-1 in comparison with the pristine Ni-MOF powder of 114 C g-1 at 2 A g-1. DFT calculations reveal that introduction...
-
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...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Electrochemical Characterization of Gelatine Derived Ceramics
PublikacjaNew materials obtained by pyrolysis of gelatine (G) and poly(1,2-dimethylsilazane) (PSN) (weight ratio: G/PSN 70/30) at temperatures 700 and 900 °C were characterized by SEM and Raman spectroscopy. The presence of ceramics influences on the cluster size of the materials. Electrochemical tests were performed by cyclic voltammetry and galvanostatic cyclic polarization. The capacity of G/PSN was 464 and 527 mAh/g for materials pyrolysed...
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Accumulation of volatile constituents in agar and bioreactor shoot cultures of Verbena officinalis L.
PublikacjaIn vitro shoot cultures of common vervain (Verbena officinalis L., Verbenaceae) were established and evaluated for essential oil content. The shoots were maintained as stationary microshoot culture, grown on Schenk–Hildebrandt medium supplemented with 9.84 µM of 2-isopentenyladenine and 1.0 µM of thidiazuron. The shoots were further adapted to grow in two temporary immersion bioreactors (RITA and Plantform), using Schenk–Hildebrandt...
-
Profil kwasów tłuszczowych mleka pochodzącego od krów żywionych w systemie TMR
PublikacjaW pracy analizowano profil kwasów tłuszczowych (KT) mleka pochodzącego od krów żywionych w systemie TMR (Total Mixed Ratio) w cyklu rocznym, uwzględniając skład lipidów paszy. Pasze objętościowe(kiszonka z kukurydzy i sianokiszonka) były znaczącym źródłem PUFA, zwłaszcza pochodzące z roku 2009, a ich skarmianie rozpoczęto w okresie jesiennym. W składzie KT mleka z tego okresu stwierdzono znacznie większą zawartość: MUFA, CLA i...
-
Modern power-electronics installations in the Polish electrical power network
PublikacjaThe paper discusses the most important areas of application of power electronics arrangements in the Polish electrical power system; especially in the distribution system. The examples presented demonstrate both the need for and the purpose of further research and its applications in these fields, as well as indicating the direction of future research, with special consideration given to the research required in Poland. The proposed...
-
Modelling of dark fermentation of glucose and sour cabbage
PublikacjaIn the article, modified Anaerobic Digestion Models 1 (ADM-1) was tested for modelling dark fermentation for hydrogen production. The model refitting was done with the Euler method. The new model was based on sets of differential equations. The model was checked for hydrogen production from sour cabbage in batch and semi-batch in 5 g VSS (volatile solid suspension)/L and at the semi-batch process from glucose at 5 and 10 g VSS/L....
-
Recovery of Anammox Biomass at Short Hydraulic Retention Time in a MBR Reactor
PublikacjaThe anammox system has been consider as an economical option for treating high concentration of nitrogen and poor in biodegradable orgaednic carbon wastewaters. This process is attractive option compared with conventional nitrogen removal because it provides a significant saving in aeration and organic addition for denitrification. The anammox technology has been applied mostly for concentrated nitrogenous wastewater containing...
-
On-line Ramsey Numbers of Paths and Cycles
PublikacjaConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
Finding small-width connected path decompositions in polynomial time
PublikacjaA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Assessment of Corrosive Behaviour and Microstructure Characterization of Hybrid Friction Stir Welded Martensitic Stainless Steel
PublikacjaThis study examined the effect of induction heating on the microstructure and corrosion characteristics of hybrid friction stir welded AISI 410 stainless steel. Five joints have been produced with different friction stir welding parameters like welding speed, spindle speed, plunge depth, and induction power. Their microstructures were evaluated using a scanning electron microscope, and chemical composition was examined using...
-
Some variations of perfect graphs
PublikacjaWe 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...
-
Emissions of selected monoaromatic hydrocarbons as a factor affecting the removal of single-use polymer barbecue and kitchen utensils from everyday use
PublikacjaThe main focus of this study is the emission of monoaromatic hydrocarbons because these are the preliminary factors of potential solvent and monomer residues present in single-use plastic barbecue and kitchen utensils comprising polystyrene, polypropylene, natural cellulose, and biodegradable polymers intended for use with hot meal or beverages. Herein, the emissions of monoaromatic hydrocarbons (styrene, benzene, toluene, ethylbenzene,...
-
Global defensive secure structures
PublikacjaLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
Low energy elastic electron scattering from benzonitrile (C6H5CN)
PublikacjaWe present experimental differential elastic scattering cross sections (DCSs) for low energy electron scattering from benzonitrile along with integral and momentum-transfer cross sections that are determined from these DCSs. The measurements of DCSs are obtained using the relative flow method with helium as the standard gas, in a crossed electron-molecular gas beam arrangement. Our measurements are made at incident electron energies...
-
N-doped graphene quantum dot-decorated MOF-derived yolk-shell ZnO/NiO hybrids to boost lithium and sodium ion battery performance
PublikacjaSurface engineering at the nanoscale to obtain robust interface between metal oxides and quantum dots is essential for improving the performance and stability of battery materials. Herein, we designed and prepared novel N-doped graphene quantum dot-modified ZnO/NiO anode materials with a well-defined yolk-shell structure for lithium and sodium-ion batteries. NG QDs were assembled on the ZnO/NiO microspheres using three different...
-
The Rate of Improvement in Metabolic Control in Children with Diabetes Mellitus Type 1 on Insulin Glargine Depends on Age
Publikacja