Publikacje
Filtry
wszystkich: 101
Katalog Publikacji
-
On the partition dimension of trees
PublikacjaGiven 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...
-
On the mixing property and the ergodic principle for nonhomogeneous Markov chains
PublikacjaW pracy rozważane są różne typy zachowania granicznego nieskończenie wymiarowych niejednorodnych łańcuchów Markowa z czasem dyskretnym. Badana jest struktura geometryczna zbioru łańcuchów Markowa w normowej i mocnej topologii operatorowej.
-
Changes in gene methylation patterns in neonatal murine hearts: Implications for the regenerative potential
PublikacjaBackground The neonatal murine heart is able to regenerate after severe injury; this capacity however, quickly diminishes and it is lost within the first week of life. DNA methylation is an epigenetic mechanism which plays a crucial role in development and gene expression regulation. Under investigation here are the changes in DNA methylation and gene expression patterns which accompany the loss of regenerative potential. Results The...
-
On mixing in the class of quadratic stochastic operators
PublikacjaWe study different types of limit behavior of quadratic stochastic operators acting on ℓ^1 (or ℓ^1_d) spaces in both strong and uniform topologies. The main motif of the paper is to express the uniform and strong asymptotic stability of the quadratic stochastic operator in terms of convergence of the associated (linear) nonhomogeneous Markov chain. We also examine which type of uniform convergence of iterates of the quadratic...
-
On the super domination number of lexicographic product graphs
PublikacjaThe 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...
-
Folate/homocysteine metabolism and lung cancer risk among smokers
PublikacjaBackground: Folate and homocysteine are involved in DNA synthesis and methylation processes, which are deregulated during carcinogenesis. Objectives: The aim of this study was to assess the relationship between folate/homocysteine concentrations, the functional polymorphisms of folate/homocysteine genes and lung cancer risk among cigarette smokers. Study design: The study included 132 lung cancer patients and 396 controls from...
-
Result of the 6-min walk test is an independent prognostic factor of surgically treated non-small-cell lung cancer
PublikacjaPathological tumour, node and metastasis (TNM) stage remains the most significant prognostic factor of non-small-cell lung cancer (NSCLC). Meanwhile, age, gender, pulmonary function tests, the extent of surgical resection and the presence of concomitant diseases are commonly used to complete the prognostic profile of the patient with early stage of NSCLC. The aim of this study is to assess how the result of a 6-min walk test (6MWT)...
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
Total outer-connected domination in trees
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
Crystallization of space: Space-time fractals from fractal arithmetic
PublikacjaFractals such as the Cantor set can be equipped with intrinsic arithmetic operations (addition, subtraction, multiplication, division) that map the fractal into itself. The arithmetics allows one to define calculus and algebra intrinsic to the fractal in question, and one can formulate classical and quantum physics within the fractal set. In particular, fractals in space-time can be generated by means of homogeneous spaces associated...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract 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.
-
Fourier transforms on Cantor sets: A study in non-Diophantine arithmetic and calculus
PublikacjaFractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration, and complex structure. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has all the required basic properties. As an example we discuss a sawtooth signal on the ternary middle-third Cantor set. The formalism works also for fractals that are not self-similar.
-
Quadratic stochastic operators on Banach lattices
PublikacjaWe study the convergence of iterates of quadratic stochastic operators that are mean monotonic. They are defined on the convex set of probability measures concentrated on a weakly compact order interval S = [0, f] of a fixed Banach lattice F. We study their regularity and identify the limits of trajectories either as the “infimum” or “supremum” of the support of initial distributions.
-
Quantum structure in competing lizard communities
PublikacjaAlmost two decades of research on applications of the mathematical formalism of quantum theory as a modeling tool in domains different from the micro-world has given rise to many successful applications in situations related to human behavior and thought, more specifically in cognitive processes of decision-making and the ways concepts are combined into sentences. In this article, we extend this approach to animal behavior, showing...
-
Two almost homoclinic solutions for second-order perturbed Hamiltonian systems
PublikacjaW niniejszym artykule badamy problem istnienia rozwiązań prawie homoklinicznych (rozwiązań znikających w nieskończonościach) dla układów Hamiltonowskich drugiego rzędu (układów Newtonowskich) z zaburzeniem. Nasz wynik jest uogólnieniem twierdzenia Rabinowitza-Tanaki o istnieniu rozwiązania homoklinicznego dla układów bez zaburzenia [Math. Z. 206 (1991) 473-499]. O zaburzeniu zakładamy, że jest dostatecznie małe w przestrzeni funkcji...
-
Prevalence Problem in the Set of Quadratic Stochastic Operators Acting on L1
PublikacjaThis paper is devoted to the study of the problem of prevalence in the class of quadratic stochastic operators acting on the L1 space for the uniform topology. We obtain that the set of norm quasi-mixing quadratic stochastic operators is a dense and open set in the topology induced by a very natural metric. This shows the typical long-term behaviour of iterates of quadratic stochastic operators.
-
Comprehensive stabilization of all streams of solid residues formed during sewage sludge thermal treatment – Case study
PublikacjaModern wastewater treatment plants are currently struggling with the problem of processing and ecological management of sewage sludge. Thermal utilization is a frequently used practice of excess sludge utilization especially in large wastewater treatment plants, which seems to be a quite promising concept. However, during thermal treatment, fractions of ashes and dusts are generated. Such wastes, especially the dust fraction, can...
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Certified domination
PublikacjaImagine 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...
-
Bondage number of grid graphs
PublikacjaThe 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.
-
On quasi-compact Markov nets
PublikacjaAnalizuje się strukturę ergodyczną netów Markowa. W szczególności podano charakteryzację ściśle ergodycznych minimalnych (L-R) netów markowskich na zwartej przestrzeni fazowej. Uzyskano warunki równoważne quasi-zwartości (L-R) netów Markowa, rozszerzając tzw. ergodyczne twierdzenie Lotz'a.
-
The shadowing chain lemma for singular Hamiltonian systems involving strong forces
PublikacjaW niniejszym artykule rozważamy autonomiczny układ Hamiltonowski na płaszczyźnie z potencjałem, który ma punkt osobliwy (studnię nieskończonej głębokości) i maksimum globalne właściwe równe zero przyjmowane w dwóch różnych punktach płaszczyzny. Przy założeniu, że w otoczeniu punktu osobliwego potencjał spełnia warunek Gordona(gradient tego potencjału w otoczeniu punktu osobliwego jest tzw. silną siłą, ang. a strong force) dowodzimy...
-
The convex domination subdivision number of a graph
PublikacjaLet 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...
-
Weak Stability of Centred Quadratic Stochastic Operators
PublikacjaWe consider the weak convergence of iterates of so-called centred quadratic stochastic operators. These iterations allow us to study the discrete time evolution of probability distributions of vector-valued traits in populations of inbreeding or hermaphroditic species, whenever the offspring’s trait is equal to an additively perturbed arithmetic mean of the parents’ traits. It is shown that for the existence of a weak limit, it...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe 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...
-
Systems, environments, and soliton rate equations: A non-Kolmogorovian framework for population dynamics
PublikacjaSoliton rate equations are based on non-Kolmogorovian models of probability and naturally include autocatalytic processes. The formalism is not widely known but has great unexplored potential for applications to systems interacting with environments. Beginning with links of contextuality to non- Kolmogorovity we introduce the general formalism of soliton rate equations and work out explicit examples of subsystems interacting with...
-
Weakly convex domination subdivision number of a graph
PublikacjaA 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...
-
Weakly connected Roman domination in graphs
PublikacjaA 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...
-
Homoclinics for singular strong force Lagrangian systems
PublikacjaWe study the existence of homoclinic solutions for a class of generalized Lagrangian systems in the plane, with a C1-smooth potential with a single well of infinite depth at a point ξ and a unique strict global maximum 0 at the origin.Under a strong force condition around the singular point ξ, via minimization of an action integral, we will prove the existence of at least two geometrically distinct homoclinic solutions.
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe 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...
-
Homoclinic orbits for a class of singular second order Hamiltonian systems in ℝ3
PublikacjaWe consider a conservative second order Hamiltonian system \ddot{q}+ ∇V(q)=0 in R3 with a potential V having a global maximum at the origin and a line l ∩ {0} = ∅ as a set of singular points. Under a certain compactness condition on V at infinity and a strong force condition at singular points we study, by the use of variational methods and geometrical arguments, the existence of homoclinic solutions of the system.
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublikacjaPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
The Maslov index and the spectral flow—revisited
PublikacjaWe give an elementary proof of a celebrated theorem of Cappell, Lee and Miller which relates the Maslov index of a pair of paths of Lagrangian subspaces to the spectral flow of an associated path of self-adjoint first-order operators. We particularly pay attention to the continuity of the latter path of operators, where we consider the gap-metric on the set of all closed operators on a Hilbert space. Finally, we obtain from Cappell,...
-
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
Trees with equal restrained domination and total restrained domination numbers
PublikacjaW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
A Noether theorem for stochastic operators on Schatten classes
PublikacjaWe prove that a stochastic (Markov) operator S acting on a Schatten class C_1 satisfies the Noether condition S'(A) = A and S'(A^2) = A^2, where A is a Hermitian bounded linear operator on a complex Hilbert space H, if and only if, S(E(G)XE(G)) = E(G)S(X)E(G) holds true for every Borel subset G of the real line R, where E(G) denotes the orthogonal projection coming from the spectral resolution of A. Similar results are obtained...
-
Bifurcation of equilibrium forms of an elastic rod on a two-parameter Winkler foundation
PublikacjaWe consider two-parameter bifurcation of equilibrium states of an elastic rod on a deformable foundation. Our main theorem shows that bifurcation occurs if and only if the linearization of our problem has nontrivial solutions. In fact our proof, based on the concept of the Brouwer degree, gives more, namely that from each bifurcation point there branches off a continuum of solutions.
-
Secure Italian domination in graphs
PublikacjaAn 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...
-
Global defensive sets in graphs
PublikacjaIn 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...
-
Some Progress on Total Bondage in Graphs
PublikacjaThe 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.
-
Connecting orbits for a periodically forced singular planar Newtonian system
PublikacjaW niniejszym artykule badamy problem istnienia i krotności rozwiązań homoklinicznych i heteroklinicznych dla nieautonomicznych układów Newtonowskich na płaszczyźnie z potencjałem okresowym ze względu na zmienną czasową, mającym maksimum globalne właściwe przyjmowane w dwóch punktach płaszczyzny i punkt osobliwy (studnię nieskończonej głębokości), w otoczeniu którego potencjał spełnia warunek Gordona (gradient potencjału ze względu...
-
The paired-domination and the upper paired-domination numbers of graphs
PublikacjaIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
Association of Genes Related to Oxidative Stress with the Extent of Coronary Atherosclerosis
PublikacjaOxidative stress is believed to play a critical role in atherosclerosis initiation and progression. In line with this, in a group of 1099 subjects, we determined eight single nucleotide polymorphisms (SNPs) related to oxidative stress (PON1 c.575A>G, MPO c.463G>A, SOD2 c.47T>C, GCLM c.590C>T, NOS3 c.894G>T, NOS3 c.786T>C, CYBA c.214C>T, and CYBA c.932A>G) and assessed the extent of atherosclerosis in coronary arteries based on...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven 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...
-
Asymptotic behaviour in the set of nonhomogeneous chains of stochastic operators
PublikacjaWe study different types of asymptotic behaviour in the set of (infinite dimensional) nonhomogeneous chains of stochastic operators acting on L1(μ) spaces. In order to examine its structure we consider different norm and strong operator topologies. To describe the nature of the set of nonhomogeneous chains of Markov operators with a particular limit behaviour we use the category theorem of Baire. We show that the geometric structure...
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
A note on a Wiener-Wintner theorem for mean ergodic Markov amenable semigroups
PublikacjaWe prove a Wiener-Wintner ergodic type theorem for a Markov representation of a right amenable semitopological semigroup.
-
Subcritical bifurcation of free elastic shell of biological cluster
PublikacjaIn this paper we will investigate symmetry-breaking bifurcation of equilibrium forms of biological cluster. A biological cluster is a two-dimensional analogue of a gas balloon. The cluster boundary is connected with its kernel by elastic links. The inside part is filled with compressed gas or fluid. Equilibrium forms of biological cluster can be found as solutions of a certain second order ordinary functional-differential equation...
-
Convex universal fixers
PublikacjaPraca dotyczy dominowania wypukłego w grafach pryzmowych.