Search
Filters
total: 936
filtered: 305
-
Catalog
Chosen catalog filters
Search results for: MATHEMATICS
-
Symmetry-Breaking Bifurcation for Free Elastic Shell of Biological Cluster, Part 2
PublicationWe will be concerned with a two-dimensional mathematical model for a free elastic shell of biological cluster. The cluster boundary is connected with its kernel by elastic links. The inside part is filled with compressed gas or fluid. Equilibrium forms of the shell of biological cluster may be found as solutions of a certain nonlinear functional-differential equation with several physical parameters. For each multiparameter this...
-
Boundary problems for fractional differential equations
PublicationIn this paper, the existence of solutions of fractional differential equations with nonlinear boundary conditions is investigated. The monotone iterative method combined with lower and upper solutions is applied. Fractional differential inequalities are also discussed. Two examples are added to illustrate the results.
-
Elastoplastic law of Cosserat type in shell theory with drilling rotation
PublicationWithin the framework of six-parameter non-linear shell theory, with strain measures of the Cosserat type, we develop small-strain J2-type elastoplastic constitutive relations. The relations are obtained from the Cosserat plane stress relations assumed in each shell layer, by through-the-thickness integration employing the first-order shear theory. The formulation allows for unlimited translations and rotations. The constitutive...
-
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...
-
Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
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.
-
On dynamic equations with deviating arguments
PublicationPraca dotyczy istnienia rozwiązań równań dynamicznych z odchylonymi argumentami. Podane zostały warunki dostateczne na istnienie rozwiązania. Dwa przykłady ilustrują otrzymane wyniki.
-
On nonlinear two-point boundary value problems for impulsive differential-algebraic problems [online]
PublicationSformułowano warunki dostateczne na istnienie ekstremalnych rozwiązań dla zagadnień brzegowych dla równań różniczkowo-algebraicznych z impulsami. Badano też nierówności różniczkowo-algebraiczne z impulsami przy odpowiednich warunkach brzegowych. Na przykładzie zilustrowano otrzymane wyniki.
-
Positive solutions for three-point one-dimensional p-Laplacian boundary value problems with advanced arguments [online]
PublicationPraca dotyczy problemów istnienia dodatnich rozwiązań dla trzy-punktowych zagadnień brzegowych z wyprzedzonymi argumentami. Zastosowano twierdzenie Avery-Petersona o punkcie stałym aby uzyskać warunki dostateczne na istnienie conajmniej trzech dodatnich rozwiązań.
-
Total outer-connected domination numbers of trees
PublicationNiech G=(V,E) będzie grafem bez wierzchołków izolowanych. Zbiór wierzchołków D nazywamy zbiorem dominującym totalnym zewnętrznie spójnym jeżli każdy wierzchołek grafu ma sąsiada w D oraz podgraf indukowany przez V-D jest grafem spójnym. Moc najmniejszego zbioru D o takich własnościach nazywamy liczbą dominowania totalnego zewnątrznie spójnego. Praca m.in. zawiera dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego...
-
Existence of positive solutions to second order four-point impulsive differential problems with deviating arguments [online]
PublicationW pracy dyskutowane są problemy brzegowe dla równań różniczkowych rzędu drugiego z impulsami i z odchylonymi argumentami. Badano przypadki dla argumentów opóźnionych i wyprzedzonych. Podano warunki które gwarantują, że omawiane problemy mają rozwiązania dodatnie. Zastosowano odpowiednie twierdzenie o punkcie stałym.
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Boundary value problems for differential equations with deviated arguments which depend on the unknown solution
PublicationDyskutowane są zagadnienia brzegowe dla równań różniczkowo funkcyjnych pierwszego rzędu z odchylonym argumentem zależnym od nieznanego rozwiązania. Sformułowane są warunki dostateczne isnienia quasirozwiązań i rozwiązań takich zagadnień.
-
A note on the strength and minimum color sum of bipartite graphs
PublicationSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublicationDla ustalonej wartości parametru k>=2, problem maksymalnego podgrafu krawędziowo k-kolorowalnego polega na wskazaniu k rozłącznych skojarzeń w grafie prostym, a kryterium optymalizacji jest maksymalizacja całkowitej liczby użytych krawędzi. W pracy podano algorytmy 5/6- i 4/5-przybliżone odpowiednio dla przypadków k=2 i k=3, poprawiając wyniki znane z literatury.
-
A note on the weakly convex and convex domination numbers of a torus
PublicationW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
A new approach to numerical solution of fixed-point problems and its application to delay differential equations
PublicationW pracy rozpatruje się pewne aproksymacje punktu stałego ciągłego operatora A odwzorowującego przestrzeń metryczną w siebie. Wspomniany punkt stały przybliża się tzw. epsilon przybliżonym punktem stałym z przestrzeni skończenie wymiarowej. Udowodnione zostało twierdzenie dające warunki konieczne i dostateczne istnienia punktu stałego w ogólnej przestrzeni metrycznej. Warunki te wyrażone są w terminach epsilon przybliżonego punktu...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Hat problem on odd cycles
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 a win. In this version every player can...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Surface effects of network materials based on strain gradient homogenized media
PublicationThe asymptotic homogenization of periodic network materials modeled as beam networks is pursued in this contribution, accounting for surface effects arising from the presence of a thin coating on the surface of the structural beam elements of the network. Cauchy and second gradient effective continua are considered and enhanced by the consideration of surface effects. The asymptotic homogenization technique is here extended to...
-
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...
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Global edge alliances in graphs
PublicationIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Comparison of anti-plane surface waves in strain-gradient materials and materials with surface stresses
PublicationHere we discuss the similarities and differences in anti-plane surface wave propagation in an elastic half-space within the framework of the theories of Gurtin–Murdoch surface elasticity and Toupin–Mindlin strain-gradient elasticity. The qualitative behaviour of the dispersion curves and the decay of the obtained solutions are quite similar. On the other hand, we show that the solutions relating to the surface elasticity model...
-
Mathematical analysis of a generalised p53-Mdm2 protein gene expression model
PublicationWe propose the generalisation of the p53-Mdm2 protein gene expression model introduced by Monk (2003). We investigate the stability of a unique positive steady state and formulate conditions which guarantee the occurrence of the Hopf bifurcation. We show that oscillatory behaviour can be caused not only by time lag in protein transcription process, but also can be present in the model without time delay. Moreover, we investigate...
-
A polynomial algorithm for finding T-span of generalized cacti.
PublicationW pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.
-
The complexity of the T-coloring problem for graphs with small degree.
PublicationW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Response to David Steigmann’s discussion of our paper
PublicationWe respond to David Steigmann's discussion of our paper "A general theory for anisotropic Kirchhoff-Love shells with in-plane bending of embedded fibers, Math. Mech. Solids, 28(5):1274-1317" (arXiv:2101.03122). His discussion allows us to clarify two misleading statements in our original paper, and confirm that its formulation is fully consistent with the formulation of Steigmann. We also demonstrate that some of our original statements...
-
Numerical integration of a coupled Korteweg-deVries system
PublicationMetoda numeryczna została wprowadzona do rozwiązania ogólnych układów równańKorteweg´a- de Vries´a. Zastosowana do równania Hirota-Satsuma.
-
Periodic solutions of Lagrangian systems under small perturbations
PublicationIn this paper we prove the existence of mountain pass periodic solutions of a certain class of generalized Lagrangian systems under small perturbations. We show that the found periodic solutions converge to a periodic solution of the unperturbed system if the perturbation tends to 0. The proof requires to work in a rather unusual (mixed) Orlicz–Sobolev space setting, which bears several challenges.
-
Flow through a prosthetic mechanical aortic valve: Numerical model and experimental study
PublicationThis research presents a numerical model dedicated for virtual patient diagnostics in the field of synthetic valve implantation. The model operates based on computational fluid dynamics solver with implemented rigid body motion solver. Characteristic indicators related to the prosthetic valve were determined to assess the correctness of cardiac system operation after implantation. A novel approach for dynamic time discretization...
-
Biomimetic torene shells
PublicationThe genome inside the eukaryotic cells is guarded by a unique shell structure, called the nuclear envelope (NE), made of lipid membranes. This structure has an ultra torus topology with thousands of torus-shaped holes that imparts the structure a high flexural stiffness. Inspired from this biological design, here we present a novel ‘‘torene’’ architecture to design lightweight shell structures with ultra-stiffness for engineering...
-
Inverse shadowing and related measures
PublicationWe study various weaker forms of the inverse shadowing property for discrete dynamical systems on a smooth compact manifold. First, we introduce the so-called ergodic inverse shadowing property (Birkhoff averages of continuous functions along an exact trajectory and the approximating one are close). We demonstrate that this property implies the continuity of the set of invariant measures in the Hausdorff metric. We show that the...
-
Convergence of rational multistep methods of of Adams-Padé type
PublicationRational generalizations of multistep schemes, where the linear stiff part of a given problem is treated by an A-stable rational approximation, have been proposed by several authors, but a reasonable convergence analysis for stiff problems has not been provided so far. In this paper we directly relate this approach to exponential multistep methods, a subclass of the increasingly popular class of exponential integrators. This natural,...
-
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...
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Initial value problems for neutral fractional differential equations involving a Riemann-Liouville derivative
PublicationBadano równania neutralne typu ułamkowego z odchylonym argumentem. Podano warunki dostateczne na istnienie jednego rozwiązania.
-
Existence of solutions for a coupled system of difference equations with cousal operators
PublicationPraca dotyczy układów równań różnicowych. Podano warunki dostateczne na istnienie rozwiązań takich problemów. Badano również nierówności różnicowe.
-
Fractional equations of Volterra type involving a Riemann Liouville derivative
PublicationIn this paper, we discuss the existence of solutions of fractional equations of Volterra type with the Riemann Liouville derivative. Existence results are obtained by using a Banach fixed point theorem with weighted norms and by a monotone iterative method too. An example illustrates the results.
-
Existence results to delay fractional differential equations with nonlinear boundary conditions
PublicationPraca dotyczy problemów brzegowych dla ułamkowych równań różniczkowych z opóźnionym argumentem. Podano warunki dostateczne na istnienie rozwiązań ekstremalnych takich zagadnień.
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Green function diagonal for a class of heat equations
PublicationA construction of the heat kernel diagonal is considered as element of generalized zeta function theory, which gradient at the origin defines determinant of a differential operator in a technique for regularizing quadratic path integral. Some classes of explicit expressions of the Green function in the case of finite-gap potential coefficient of the heat equation are constructed. An algorithm and program for Mathematica are presented...
-
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.
-
Boundary vlue problems for difference equations with causal operators
PublicationPraca dotyczy problemów brzegowych dla równań różnicowych.Podano warunki dostateczne na istnienie ekstremalnych rozwiązań stosując metodę iteracji monotonicznych.
-
Two almost homoclinic solutions for second-order perturbed Hamiltonian systems
PublicationW 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...
-
Dirichlet-to-Neumann and Neumann-to-Dirichlet methods for eigenvalues and eigenfunctions of the Laplace operator
PublicationPrzedstawiono dwie metody służące do znajdowania wartości własnych i funkcji własnych równania Helmholtza w ograniczonej dziedzinie. Punktem wyjścia była konstrukcja zasad wariacyjnych uwzględniających możliwość stosowania nieciągłych funkcji próbnych (lub funkcji próbnych o nieciągłych pochodnych normalnych). Następny etap to wykorzystanie powierzchniowych operatorów całkowych typu DtN i NtD. Efektywność metod przetestowano na...
-
A note on total reinforcement in graphs
PublicationIn 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.