Filters
total: 1745
-
Catalog
displaying 1000 best results Help
Search results for: PP-G-GMA
-
Interpolation properties of domination parameters of a graph
PublicationAn 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.
-
Restrained differential of a graph
PublicationGiven a graph $G=(V(G), E(G))$ and a vertex $v\in V(G)$, the {open neighbourhood} of $v$ is defined to be $N(v)=\{u\in V(G) :\, uv\in E(G)\}$. The {external neighbourhood} of a set $S\subseteq V(G)$ is defined as $S_e=\left(\cup_{v\in S}N(v)\right)\setminus S$, while the \emph{restrained external neighbourhood} of $S$ is defined as $S_r=\{v\in S_e : N(v)\cap S_e\neq \varnothing\}$. The restrained differential of a graph $G$ is...
-
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...
-
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...
-
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}...
-
Polyacrylamide‐based phantoms as tissue substitute in experimental radiation physics
Publication -
Investigations on the influence CuO doping on elastic properties of Li2SO4–MgO–P2O5 glass system by means of acoustic wave propagation
Publication -
Influence of NiO doping on elastic properties of Li2SO4-MgO-P2O5 glass system-Investigation by means of acoustic wave propagation
Publication -
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...
-
Formation and electronic properties ofBC3single-wall nanotubes upon boron substitution of carbon nanotubes
Publication -
Stability of CII is a key element in the cold stress response of bacteriophage lambda infection
Publication -
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...
-
Monoclonal gammopathy of undetermined significance, NOS - Male, 69 - Tissue image [11290630017293191]
Open Research DataThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Monoclonal gammopathy of undetermined significance, NOS - Male, 69 - Tissue image [11290630017291571]
Open Research DataThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Monoclonal gammopathy of undetermined significance, NOS - Male, 69 - Tissue image [11290630017291931]
Open Research DataThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
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...
-
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...
-
Variations in the near-surface atmospheric electric field at high latitudes and ionospheric potential during geomagnetic perturbations
Publication -
Emilia Miszewska dr inż.
PeopleEmilia Miszewska was born in 1986 in Gdańsk. She graduated from Primary School No. 17 in Gdańsk with sports classes specializing in swimming and Janusz Kusociński Sports Secondary School No. 11 in Gdańsk. In 2005, she started uniform master's studies at the Faculty of Civil and Environmental Engineering, which she completed in 2011, defending her diploma thesis entitled "Analysis and development of fire protection guidelines and...
-
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.
-
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...
-
Analysis of a combined clutch with an electrorheological fluid
Publication -
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...
-
Carbon nanotubes chemically derivatized with rebox systems as mediators for biofuel cell applications
PublicationEnzymatyczne bioogniwa paliwowe to urządzenia wykorzystujące enzymy do przemiany energii chemicznej w elektryczną. Zyskana w ten sposób energia może służyć do zasilania wszczepialnych urządzeń (np. czujników glukozy, rozruszników serca).Przedstawiono sposób otrzymywania i właściwości bioelektrod, w których wykorzystano nanorurki węglowe modyfikowane mediatorami enzymatycznych reakcji redoks. Do nanorurek przyłączano zarówno mediatory...
-
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.
-
Plasma cell myeloma - Male, 73 - Tissue image [11290630017282651]
Open Research DataThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Plasma cell myeloma - Male, 73 - Tissue image [11290630017283871]
Open Research DataThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
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...
-
Inorganic membrane: a game changer for gas separation and purification
PublicationThis review explores the advancements and remaining challenges in inorganic membrane science, particularly focusing on their potential for industrial applications. It delves into the fundamental principles of inorganic membrane design, fabrication, and characterization techniques. The review also critically analyzes key challenges faced by inorganic membranes, such as physical aging, plasticization, defective formation, and fouling....
-
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,...
-
Wpływ równości nawierzchni i dynamicznego oddziaływania pojazdów ciężkich na trwałość zmęczeniową nawierzchni podatnych
PublicationPodczas ruchu pojazdu obserwuje się odchylenia nacisków osi pojazdów od nacisku statycznego, co jest spowodowane nierównościami nawierzchni. Dynamiczne obciążenia pojazdów w większym stopniu wytężają konstrukcję nawierzchni drogowej. Rozkład obciążeń dynamicznych ma kształt rozkładu normalnego i jest opisywany poprzez obciążenie statyczne oraz wskaźniki dynamiczne DI lub DLC. Wraz z pogorszeniem równości i zwiększeniem prędkości...
-
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...
-
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...
-
Chirp Rate and Instantaneous Frequency Estimation: Application to Recursive Vertical Synchrosqueezing
PublicationThis letter introduces new chirp rate and instantaneous frequency estimators designed for frequency-modulated signals. These estimators are first investigated from a deterministic point of view, then compared together in terms of statistical efficiency. They are also used to design new recursive versions of the vertically synchrosqueezed short-time Fourier transform, using a previously published method (D. Fourer, F. Auger, and...
-
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...
-
CdWO/sub 4/ crystal in gamma-ray spectrometry
Publication -
Enhanced sunlight photo-catalytic performances of ZnO/ZnNb2O6/Nb2O5 composites for organic pollutant degradation
Publication -
Influence of geometry and surface morphology of the U-tube on the fluid flow in the range of various velocities
Publication