Filters
total: 1867
filtered: 1331
-
Catalog
- Publications 1331 available results
- Journals 93 available results
- Conferences 2 available results
- People 86 available results
- Inventions 12 available results
- Projects 14 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 99 available results
- Events 13 available results
- Open Research Data 215 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: D%C5%B9WIGNICE
-
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...
-
Clearing directed subgraphs by mobile agents
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent 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, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
Triple helical collagen-like peptide interactions with selected polyphenolic compounds
Publication -
Design Optimization of an Anisotropic Magnetoresistance Sensor for Detection of Magnetic Nanoparticles
Publication -
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 Snow Team Problem
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Metoda prognozowania mocy skrawania przy przecinaniu piłami polskiego drewna sosnowego z uwzględnieniem wiązkości materiału obrabianego
PublicationW pracy zostały przedstawione wartości właściwości materiałowych tj.: wiązkość R oraz naprężenia tnące w strefie skrawania τy, dla drewna sosnowego (Pinus sylvestris L.). Badane próbki drewna pochodziły z czterech Krain Przyrodniczo - Leśnych Polski: Bałtyckiej Krainy Przyrodniczo - Leśnej (kraina A), Karpackiej Krainy Przyrodniczo - Leśnej (kraina B), Małopolskiej Krainy Przyrodniczo - Leśnej (kraina C) oraz Wielkopolsko - Pomorskiej...
-
Structure and properties of the exopolysaccharides produced by Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014
PublicationThis paper presents a study on the purification, primary structure, and rheological properties of exopolysaccharides isolated from cultures of Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014. Both polymers are exopolysaccharides of D-mannose. The mannan isolated from P. mutabilis T6 contains on average about 5% of residual b-D-glucose, in contrast to the mannan from P. mutabilis ATCC 31014, which contained only trace amounts...
-
On greedy graph coloring in the distributed model
PublicationArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Chemopreventive activity of bioactive fungal fractions isolated from milk-supplemented cultures of Cerrena unicolor and Pycnoporus sanguineus on colon cancer cells
Publication -
Strefa podmiejska w warunkach zrównoważonego rozwoju.
PublicationNR DOKUM: D 73137
-
Cold-Active beta-Galactosidases: Sources, Biochemical Properties and Their Biotechnological Potential
Publicationbeta-D-Galactosidases have been studied extensively in terms of their application to a variety of industrial technologies. To date, considerable research efforts have been devoted to characterization of new cold-active beta-D-galactosidases which were isolated directly from selected species of bacteria and yeasts, as well as with the use of metagenomic approaches. This chapter will provide a review of current research towards cold-active...
-
Photocatalytic properties of Nafion membranes containing graphene oxide/titania nanocomposites
Publication -
The simultaneous determination of hydrophobicity and dissociation constant by liquid chromatography–mass spectrometry
Publication -
The first order phase transition and superconductivity in BaNi2As2 single crystals
PublicationDyskutowane są synteza i właściwości fizyczne monokryształów BaNi2As2. BaNi2As2 krystalizuje w strukturze ThCr2Si2, a stałe sieciowe wynoszą odpowiednio: a = 4.112(4) A i c = 11.54(2) A. Pomiar oporu elektrycznego, zmiennopolowej podatności magnetycznej, ciepła właściwego, pokazują objętościowy efekt nadprzewodzący z Tc = 0.7 K.
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Systems of Nonlinear Fractional Differential Equations
PublicationUsing the iterative method, this paper investigates the existence of a unique solution to systems of nonlinear fractional differential equations, which involve the right-handed Riemann-Liouville fractional derivatives D(T)(q)x and D(T)(q)y. Systems of linear fractional differential equations are also discussed. Two examples are added to illustrate the results.
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
An upper bound for 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 γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Amygdalin: Toxicity, Anticancer Activity and Analytical Procedures for Its Determination in Plant Seeds
PublicationAmygdalin (D-Mandelonitrile 6-O--D-glucosido--D-glucoside) is a natural cyanogenic glycoside occurring in the seeds of some edible plants, such as bitter almonds and peaches. It is a medically interesting but controversial compound as it has anticancer activity on one hand and can be toxic via enzymatic degradation and production of hydrogen cyanide on the other hand. Despite numerous contributions on cancer cell lines, the clinical...
-
Scintillation light trapping and radiation damage in CeF/sub 3/
Publication -
Methods of preparation and performance of sealed gas photomultipliers for visible light
Publication -
CdWO/sub 4/ crystal in gamma-ray spectrometry
Publication -
Influence of geometry and surface morphology of the U-tube on the fluid flow in the range of various velocities
Publication -
Low temperature removal of SO2 traces from air by MgO-loaded porous carbons
Publication -
Electronic and lattice properties of noncentrosymmetric superconductors ThTSi (T=Co, Ir, Ni, and Pt)
Publication -
Structural and magnetic properties of Cu-alloyed FePd films
Publication -
Polymeric nanocapsules with up-converting nanocrystals cargo make ideal fluorescent bioprobes
Publication -
The influence of charge compensation defects on the spectroscopic properties of europium doped Ca9Y(PO4)7
Publication -
Robust HPLC–MS/MS method for levofloxacin and ciprofloxacin determination in human prostate tissue
Publication -
MC1R common variants, CDKN2A and their association with melanoma and breast cancer risk
Publication -
Certified domination
PublicationImagine 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...
-
A demand for innovation support in samll and medium-sized enterprises in the baltic sea region
Publicationthe aim of the expertise is to analyze the actual demand of smes from the baltic sea region for innovation support. the results of the conducted study can help formulate recommendations designed to increase innovation and competitiveness of smes in the baltic sea region in the future. research activities of this study include: the evaluation of innovation level of the baltic sea region enterprises (type and intensity of implemented...
-
Fluoride as a factor initiating and potentiating inflammation in THP1 differentiated monocytes/macrophages
Publication -
Distributed largest-first algorithm for graph coloring.
PublicationW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
New fast photomultipliers with a screening grid at the anode
Publication -
Dispersing hydrophilic nanoparticles in hydrophobic polymers: HDPE/ZnO nanocomposites by a novel template-based approach
Publication -
Accuracy Analysis of Measurements in Electrochemical Biosensing
Publication -
Combinatorial scheme of finding minimal number of periodic points for smooth self-maps of simply connected manifolds
PublicationLet M be a closed smooth connected and simply connected manifold of dimension m at least 3, and let r be a fixed natural number. The topological invariant D^m_r [f], defined by the authors in [Forum Math. 21 (2009), 491-509], is equal to the minimal number of r-periodic points in the smooth homotopy class of f, a given self-map of M. In this paper, we present a general combinatorial scheme of computing D^m_r [f] for arbitrary dimension...
-
Note on the multidimensional Gebelein inequality
PublicationWe generalize the Gebelein inequality for Gaussian random vectors in R^d.
-
Correlation between in vitro and in vivo data on food digestion. What can we predict with static in vitro digestion models?
PublicationDuring the last decade, there has been a growing interest in understanding food's digestive fate in order to strengthen the possible effects of food on human health. Ideally, food digestion should be studied in vivo on humans but this is not always ethically and financially possible. Therefore, simple in vitro digestion models mimicking the gastrointestinal tract have been proposed as alternatives to in vivo experiments. Thus,...
-
Central nervous system involvement in mantle cell lymphoma: clinical features, prognostic factors and outcomes from the European Mantle Cell Lymphoma Network†
Publication -
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...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Parametric Study on a Performance of a Small Counter-Rotating Wind Turbine
PublicationA small Counter-Rotating Wind Turbine (CRWT) has been proposed and its performancehas been investigated numerically. Results of a parametric study have been presented in this paper.As parameters, the axial distance between rotors and a tip speed ratio of each rotor have been selected.Performance parameters have been compared with reference to a Single Rotor Wind Turbine (SRWT).Simulations were carried out with Computational Fluids...
-
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublicationWe study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...