Filters
total: 3951
filtered: 2274
-
Catalog
- Publications 2274 available results
- Journals 99 available results
- Conferences 6 available results
- Publishing Houses 1 available results
- People 145 available results
- Projects 19 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 51 available results
- Events 10 available results
- Open Research Data 1344 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: CRYOCONITE, CRYOSPHERE, GLACIERS, GRAINS, INVERTEBRATES
-
Some Progress on Total Bondage in Graphs
PublicationThe 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.
-
Architektura i woda - przekraczanie granic
PublicationPublikacja daje wgląd w procesy kształtowania połączeń wody i form zbudowanych. W obserwowanych współcześnie eksperymentach struktury budynków przeplatają się z zarysami pól wodnych, powstają konstrukcje architektoniczne unoszące się na różnego rodzaju platformach pływających. Woda jest także coraz częściej włączana w projekty urbanistyczne. Linie styku pomiędzy lądem i wodą ulegają modyfikacjom, przywraca się dawne kanały i tworzy...
-
Consecutive colorings of the edges of general graphs
Publication -
Visual impairment and traits of autism in children
Publication -
On the hardness of computing span of subcubic graphs
PublicationIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
Paired domination and doubly domination in graphs
PublicationW rozprawie poruszane są zagadnienia związane z dominowaniem parami w grafach oraz domiowaniem totalno - powściągniętym w grafach. Ponadto omawiane są zagadnienia związane ze złożonością obliczeniową różnych problemów dominowania w grafach.
-
The Backbone Coloring Problem for Small Graphs
PublicationIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
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,...
-
Through the looking-glass of the grazing bifurcation
Publication -
The hat problem on a union of disjoint graphs
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Non-isolating 2-bondage in graphs
PublicationA 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)....
-
Distance paired domination numbers of graphs
PublicationW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Compact cyclic edge-colorings of graphs
PublicationArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
Weakly connected domination critical graphs
PublicationPraca dotyczy niektórych klas grafów krytycznych ze względu na liczbę dominowania słabo spójnego.
-
On the metric dimension of corona product graphs
PublicationWe give several results on the metric dimension of corona product graphs.
-
Colorings of the Strong Product of Circulant Graphs
PublicationGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
On proper (1,2)‐dominating sets in graphs
PublicationIn 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...
-
Interval incidence coloring of subcubic graphs
PublicationIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
On domination multisubdivision number of unicyclic graphs
PublicationThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
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.
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
A Framework for Searching in Graphs in the Presence of Errors
PublicationWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
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...
-
Impact of intense rains and flooding on mercury riverine input to the coastal zone
Publication -
Determination of grain shape of laser-irradiated FePdCu thin alloy films
Publication -
Effect of coarse grain aggregate on strength parameters of two-stage concrete
Publication. Two-stage concrete (TSC) is a special type of concrete that the method of its construction and implementation is different from conventional one. In TSC, coarse aggregate particles are first placed in the formwork and voids between them are subsequently injected with a special cementations mixture. TSC has been successfully used in many applications, such as underwater construction, casting concrete sections congested with reinforcement...
-
Gains selection of non-proportional observers of an induction motor with dyadic methods
PublicationThe paper presents issues related to calculation of gains of non-proportional observers of magnetic fluxes of an induction motor. A transformation is discussed, based on dyadic matrices, that affords possibility of applying well-known methods used in single-output systems to observers of multi-output systems. The impact of dyadic transformation on possibility of poles placement of the observer is analyzed....
-
Effects of Single and Repeated Footshock on Dopamine Release and Metabolism in the Brains of Fischer Rats
Publication -
Transient torsional vibrations control in the geared drive trains of the hot rolling mills
Publication -
X-ray absorption fine structure and x-ray diffraction studies of crystallographic grains in nanocrystalline FePd:Cu thin films
Publication -
Physical Activity vs. Redox Balance in the Brain: Brain Health, Aging and Diseases
Publication -
General grants and development – a relationship without a future? The effects of the structure of general grants on the development of local government units in Poland
PublicationThe purpose of this paper is to attempt to identify the reasons for the lack of relationship between general grant revenue and investment expenditure of local government units. The author formulated the hypothesis that there is no link between general grants and investment expenditure and that the reason for this are the current spending on education, absorbing the entire amount of general grants received by local government units....
-
Investigation on the Sources and Impact of Trace Elements in the Annual Snowpack and the Firn in the Hansbreen (Southwest Spitsbergen)
PublicationWe present a thorough evaluation of the water soluble fraction of the trace element composition (Ca, Sr, Mg, Na, K, Li, B, Rb, U, Ni, Co, As, Cs, Cd, Mo, Se, Eu, Ba, V, Ge, Ga, Cr, Cr, P, Ti, Mn, Zr, Ce, Zn, Fe, Gd, Y, Pb, Bi, Yb, Al, Nb, Er, Nd, Dy, Sm, Ho, Th, La, Lu, Tm, Pr, Tb, Fe, In, Tl) and their fluxes in the annual snowpack and the firn of the Hansbreen (a tidewater glacier terminating in the Hornsund fjord, southwest...
-
DYNAMIC ANALYSIS OF HISTORIC RAILWAY BRIDGES IN POLAND IN THE CONTEXT OF ADJUSTING THEM TO PENDOLINO TRAINS
PublicationThe article presents the dynamic analysis of the historic railway bridge in Tczew as an example of the usefulness of such type of bridge for high-speed trains. The model of the bridge and the simulation of rolling stock passage was performed in SOFISTIK program. The scope of work includes experimental studies, the solution of the problem concerning the correct solution features dynamic model takes into account the dependencies...
-
Set of Experience and Decisional DNA: Toward Brains for Cyber-physical Systems and Industry of the Future
PublicationThe concept of Decisional DNA is decade old. This article introduces the initial idea of Set of Experience Knowledge Structure, its advancement into Decisional DNA, and its potential for real life applications in divers domains. The most current and future research steps into Industry 4.0 are also presented and discussed
-
DYNAMIC ANALYSIS OF THE RAILWAY BRIDGES IN POLAND WITH REGARDS TO HIGH-SPEED TRAINS PASSAGE ADJUSTMENT
PublicationThe dynamic analysis of the railway bridge in Tczew was carried out in the article as an example of such bridges adaptation suitability to handle high-speed trains. Calculations of railway bridges are greatly complicated and labor-consuming. The bridge model and a rolling stock passage simulation were developed in the SOFISTIK software. Three types of elements were used for the correct mapping of the structure in the calculation...
-
Effect of Grain Husk Microfibers on Physicochemical Properties of Carboxymethyl Polysaccharides-Based Composite
Publication -
Unmasking the COVID-19 Pandemic Prevention Gains: Excess Mortality Reversal in 2022
PublicationObjectives: The purpose of this study was to assess the long-term effectiveness of COVID-19 pandemic prevention measures in saving lives after European governments began to lift restrictions. Study design: Excess mortality interrupted time series.Methods: Country-level weekly data on deaths were fitted to the Poisson mixed linear model to estimate excess deaths. Based on this estimate, the percentage of excess deaths...
-
Unmasking the COVID-19 pandemic prevention gains: excess mortality reversal in 2022
Publication -
Enhanced aging resistance of poly(ε-caprolactone)/brewers’ spent grain composites
PublicationThe presented paper investigated the influence of brewers’ spent grain (BSG) extrusion pa-rameters on the photo-oxidative resistance of poly(ε-caprolactone)-based wood polymer composites. Filler samples characterized by the higher melanoidin content were more efficient in hindering of poly-mer degradation, inhibiting the decomposition of the polymer amorphous phase. As aresult, deteriora-tion of mechanical performance was limited,...
-
Effect of Sieve Unit Inclination Angle in a Rotary Cleaning Device for Barley Grain
Publication -
Genetic Algorithm Approach for Gains Selection of Induction Machine Extended Speed Observer
PublicationThe subject of this paper is gains selection of an extended induction machine speed observer. A high number of gains makes manual gains selection difficult and due to nonlinear equations of the observer, well-known methods of gains selection for linear systems cannot be applied. A method based on genetic algorithms has been proposed instead. Such an approach requires multiple fitness function calls; therefore, using a quality index...
-
Towards Increasing Density of Relations in Category Graphs
PublicationIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
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...
-
Minimum order of graphs with given coloring parameters
PublicationA 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),...
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Parallel query processing and edge ranking of graphs
PublicationArtykuł poświęcony jest problemowi szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym. Jednym z zastosowań jest poszukiwanie optymalnych harmonogramów w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie funkcji dobroci przybliżonego algorytmu autorstwa Makino, Uno i Ibaraki wraz z rezultatami testów komputerowych przeprowadzonych dla grafów losowych.
-
Strong weakly connected domination subdivisible graphs
PublicationArtykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.