Search
Filters
total: 1666
displaying 1000 best results Help
Search results for: G-KWADRUPLEKSY
-
The convex domination subdivision number of a graph
PublicationLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $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}...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA 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...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublicationThe 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...
-
The emissions of monoaromatic hydrocarbons from small polymeric toys placed in chocolate food products
PublicationThe article presents findings on the emissions of selected monoaromatic hydrocarbons from children's toys placed in chocolate food products. The emission test system involved the application of a new type of microscale stationary emission chamber, μ-CTE™ 250. In order to determine the type of the applied polymer in the manufacture of the tested toys, Fourier transform infrared spectroscopy and thermogravimetric analysis coupled...
-
Confined granular flow in silos with inserts - full-scale experiments
PublicationArtykuł omawia wyniki doświadczalne przepływów silosowych w silosach w naturalnej skali ze wstawkami. Podczas doświadczeń pomierzono przemieszczenia oraz napór na ściany. Zastosowano różne typy wstawek położone na różnej wysokości. Wyniki badań doświadczalnych porównano z przepływami bez wstawek.
-
2-outer-independent domination in graphs
PublicationWe 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,...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $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...
-
Evaluation of Langmuir and Freundlich Isotherms for Removal of Cephalexin and Tetracycline Antibiotics By Sistan Sand from Water and Wastewater Samples
PublicationIn 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...
-
Konkurencyjność międzynarodowa krajów
PublicationZa podstawę badań autorskich nt. konkurencyjności międzynarodowej przyjęto raporty World Economic Forum (WEF). W rozdziale pierwszym przedstawiono rozważania związane z teoretycznymi aspektami konkurencyjności międzynarodowej oraz zaproponowano autorską definicję pojęcia konkurencyjności międzynarodowej kraju. W rozdziale drugim omówiono metodologię pomiaru Global Competitiveness Index (GCI). Podjęto próbę krytycznej oceny GCI,...
-
Właściwości interpolacyjne parametrów dominowania w grafach
PublicationFunkcję Pi o wartościach całkowitych nazywamy funkcją interpolującą, jeżeli dla każdego spójnego grafu G, Pi(T(G)) jest interwałem, przy czym T(G) jest zbiorem wszystkich drzew spinających grafu G. W artykule tym przedstawia się interpolacyjny charakter parametrów związanych z różnymi rodzajami dominowania.
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor 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.
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe 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 Tradeoffs Between Width- and Fill-like Graph Parameters
PublicationIn 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,...
-
Weakly convex domination subdivision number of a graph
PublicationA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Clarke duality for Hamiltonian systems with nonstandard growth
PublicationWe consider the existence of periodic solutions to Hamiltonian systems with growth conditions involving G-function. We introduce the notion of symplectic G-function and provide relation for the growth of Hamiltonian in terms of certain constant CG associated to symplectic G-function G. We discuss an optimality of this constant for some special cases. We also provide applications to the Φ-laplacian type systems.
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract 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.
-
Effects of liquid phase modification on the performance of biotrickling filters
Open Research DataDataset presents the effects of liquid phase modification on the biotrickling filtration (BTF) performance of air polluted with toluene, ethylbenzene, xylene and styrene.
-
Conversion of waste biomass to designed and tailored activated chars with valuable properties for adsorption and electrochemical applications
PublicationWaste 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...
-
Electrochemical Characterization of Gelatine Derived Ceramics
PublicationNew 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...
-
Weakly connected Roman domination in graphs
PublicationA 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...
-
Bondage number of grid graphs
PublicationThe 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.
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 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 Potential of Greed for Independence
PublicationThe 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...
-
Liczba wiązania grafów krawędziowych
PublicationLiczba wiązania b(G) grafu G jest mocą najmniejszego zbioru krawędzi, których usunięcie z grafu G prowadzi do grafu o liczbie dominowania większej niż gamma(G). Pokazujemy ogólne ograniczenia dla liczby wiązania grafu krawędziowego dowolnego grafu spójnego i grafu pełnego. Ponadto rozważamy liczbę wiązania grafów krawędziowych dla szczególnych przypadków drzew.
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Postępy technik w elektronice
e-Learning CoursesPostępy technik w elektronice [moduł dyscyplinarny, do wyboru Grupa A] Prowadzący: Prof. Marcin Gnyba, Prof. Małgorzata Jędrzejeska-Szczerska, Prof. Piotr Jasiński, Prof. Janusz Smulko, Prof. Sebastian Molin, Prof. Łukasz Kulas Terminy: 15.04 (g. 14-16), 16.04 (g. 12-14), 14.05 (g. 13-15), 19.05 (g.17-19), 26.05 (g. 17-19) 27.05 (g.10-12 ) 28.05 (10-13) Tematyka realizowanego przedmiotu obejmuje: Czujniki elektroniczne...
-
Czujniki wielkości nieelektrycznych [moduł dyscyplinarny, do wyboru Grupy A i B] 2022/2023
e-Learning CoursesProwadzący: dr hab. inż. Grzegorz Lentka, prof. PG Terminy: ( 3 godz. x 5 spotkań online): 19.11 (sob.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 20.11 (ndz.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 17.12 (sob.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 18.12 (ndz.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 14.01 (sob.) g. 12:00 do 14:30 (3x 45 min + 15 min przerwy) Tematyka realizowanego przedmiotu obejmuje: Wprowadzenie...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe 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...
-
Synthesis of Trehalose by the Erythritol-Producing Yeast Yarrowia lipolytica Co-Displaying Maltooligosyltrehalose Synthase and Maltooligosyltrehalose Trehalohydrolase
PublicationIndustrial trehalose production faces economic challenges with costly enzyme preparations, prompting the exploration of eco-friendly alternatives. Here, we established a coupled functional sugar production line leveraging erythritolproducing cells as an innovative enzyme preparation for trehalose synthesis. The erythritol-producing Yarrowia lipolytica was modified to express a fusion protein consisting of maltooligosyltrehalose synthase...
-
A Strategy to Locate Fixed Points and Global Perturbations of ODE’s: Mixing Topology with Metric Conditions
PublicationIn this paper we discuss a topological treatment for the planar system z' = f (t, z) + g(t, z) where f and g are T -periodic in time and g(t, z) is bounded. Namely, we study the effect of g(t, z) in two different frameworks: isochronous centers and time periodic systems having subharmonics. The main tool employed in the proofs consists of a topological strategy to locate fixed points in the class of orientation preserving embedding...
-
CMS Physics Technical Design Report, Volume II: Physics Performance
Publication -
Secure Italian domination in graphs
PublicationAn 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...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven 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...
-
Global defensive secure structures
PublicationLet 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...
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Equitable coloring of corona multiproducts of graphs
PublicationWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Liczby Ramseya on-line dla różnych klas grafów
PublicationRozpatrujemy grę rozgrywaną na nieskończonej liczbie wierzchołków, w której każda runda polega na wskazaniu krawędzi przez jednego gracza - Budowniczego oraz pokolorowaniu jej przez drugiego gracza - Malarkę na jeden z dwóch kolorów, czerwony lub niebieski. Celem Budowniczego jest zmuszenie Malarki do stworzenia monochromatycznej kopii wcześniej ustalonego grafu H w jak najmniejszej możliwej liczbie ruchów. Zakładamy, że gracze...
-
Diffusible hydrogen content in deposited metal of multilayer welded joints
PublicationThe article describes manufacturing technology of multilayer joints in terms of control the diffusible hydrogen content. Diffusible hydrogen content in deposited metal for multilayer welded joints made of covered rutile electrodes or covered cellulosic and basic electrodes was determined. It was found that after four beads, the diffusible hydrogen content decreases in the case of the first technology from 36 ml/100 g to 18 ml/100...
-
Finding small-width connected path decompositions in polynomial time
PublicationA 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...
-
ZAWARTOŚĆ CUKRÓW W SOKACH DRZEWNYCH Z TERENU PODKARPACIA
PublicationOznaczono zawartość cukrów w sokach drzewnych sześciu gatunków drzew rosnących na terenie Podkarpacia. Materiał doświadczalny stanowiły soki z drzew gatunków: brzoza zwisła in. brodawkowata (Betula pendula Roth.), brzoza omszona (Betula pubescens Ehrh.), grab pospolity (Carpinus betulus L.), klon zwyczajny (Acer platanoides L.), klon jesionolistny (Acer negundo L.) oraz wierzba biała (Salix alba L.). Analizę jakościową cukrów przeprowadzono...
-
Regularity of weak solutions for aclass of elliptic PDEs in Orlicz-Sobolev spaces
PublicationWe 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}$.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
An investigation of selected monoaromatic hydrocarbons released from the surface of polystyrene lids used in coffee-to-go cups
PublicationA consumer trend towards the fast preparation of beverages has increased the popularity of hot beverages (especially coffee and tea) available in disposable containers called coffee-to-go cups with fitted polystyrene lids. Lids in contact with hot beverages may release low molecular weight organic compounds into the gaseous phase causing direct exposure of consumers to these compounds during drinking. The paper describes in detail...
-
Distortion in the group of circle homeomorphisms
PublicationLet G be the group PAff+(R/Z) of piecewise affine circle homeomorphisms or the group Diff∞(R/Z) of smooth circle diffeomorphisms. A constructive proof that all irrational rotations are distorted in G is given.
-
The correlation between nutritional and health potential and antioxidant properties of raw edible oils from cultivated and wild plants
PublicationThe nutritional properties and health potential of oils from 15 various cultivated and wild plants were investigated on the basis of the fatty acids profiles, total carotenoids and tocopherols content, antioxidant properties and health potential indexes such as atherogenicity index (AI). The oil contents of the plants varied between 0.9 g/100 g for lychee seeds and 29.7 g/100 g for borage seeds. The tocopherol content in oils ranged...
-
Photocatalytic activity of zinc oxide nanorods incorporated graphitic carbon nitride catalyst
PublicationBackground 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...