Filters
total: 5017
filtered: 3122
-
Catalog
- Publications 3122 available results
- Journals 112 available results
- Conferences 6 available results
- Publishing Houses 1 available results
- People 216 available results
- Projects 31 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 55 available results
- Events 13 available results
- Open Research Data 1459 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: RICE GRAINS
-
Train the trainer course
PublicationThis chapter presents the concept, evaluation and evaluation results for the train the trainer. This concept of train the trainers is prepared within Workpackage 5 of EU-funded project: MASTER BSR (Erasmus+ Strategic Partnership Programme). Due to the nature of adult learning the content is designed for the use of participatory methods (involved, active). This method uses various techniques of active learning e.g. group work,...
-
Grass a Kaszuby/i
Publication -
Tome-lapse X-ray tomography imaging of flow patterns in versatile silo model
PublicationThe paper introduces a new versatile silo model that was especially designed for in situ X-ray tomography studies of silo discharge for various flow conditions, namely concentric and eccentric. The presented work focuses on organic granular materials where low fraction of short-grain white rice is mixed with spheroidal sorghum particles. The high-quality tomography images combined with adequate image processing strategy allows...
-
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...
-
Consecutive colorings of the edges of general graphs
Publication -
Visual impairment and traits of autism in children
Publication -
On the metric dimension of corona product graphs
PublicationWe give several results on the metric dimension of corona product graphs.
-
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)....
-
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...
-
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 Symmetry of Uniform and Preferential Attachment Graphs
PublicationMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
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...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
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...
-
Distributed Evacuation in Graphs with Multiple Exits
PublicationWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
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.
-
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...
-
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.
-
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.
-
Weakly connected domination critical graphs
PublicationPraca dotyczy niektórych klas grafów krytycznych ze względu na liczbę dominowania słabo spójnego.
-
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...
-
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
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 -
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...
-
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...
-
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...
-
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 -
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....
-
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...
-
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 -
Porous carbon derived from rice husks as sustainable bioresources: insights into the role of micro-/mesoporous hierarchy in hosting active species for lithium–sulphur batteries
PublicationThe exploration of natural resources as sustainable precursors affords a family of green materials. Exploring highly abundant and available biowaste precursors remaining from food processing throughout a scalable and cost-effective material synthesis path is highly important especially for new materials discovery in emerging energy storage technologies such as lithium–sulphur (Li–S) batteries. Herein, we have produced a series...
-
Physical Activity vs. Redox Balance in the Brain: Brain Health, Aging and Diseases
Publication -
Molecular-dynamics simulation of clustering processes in sea-ice floes
Publication -
Numerical modeling of force and contact networks in fragmented sea ice
Publication -
Numerical modelling of thermodynamics and dynamics of sea ice in the Baltic Sea
Publication -
Spectral Wave Energy Dissipation due to Under-Ice Turbulence
Publication -
Ridging, strength, and stability in high-resolution sea ice models
Publication -
Towards probabilistic models for the prediction of a ship performance in dynamic ice
Publication -
Modeling of Ice Passage Through Reservoirs System on the Vistula River
PublicationNumerical model was used to assess ice passage through proposed reservoir on the lower Vistula River. Model results were compared with observation on the Vistula River, but because the dam is not constructed yet, the direct comparison was not possible. The study focused on ice movement and accumulation in the reservoir for variety of low flow condition with and without wind effect. Bridge’s piers in the upper part of the reservoir...
-
A Numerical Model Study on Grasse River Ice Control Structures
PublicationIce jams in the Grasse River have caused the erosion of capping material designed to prevent the resurfacing of the bed sediment in the PCB-contaminated area. Two in-stream ice-control structures are proposed to avoid the jam-induced erosion of the capping material. These two ice-control options are a pier-type ice-control structure and a reconstruction of a small hydropower dam upstream of the capping site. A numerical model study...