Filtry
wszystkich: 117
wybranych: 73
Wyniki wyszukiwania dla: discrete mathematics
-
Interval incidence coloring of bipartite graphs
PublikacjaIn 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
PublikacjaIn 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...
-
A note on the weakly convex and convex domination numbers of a torus
PublikacjaW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe 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.
-
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...
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Global edge alliances in graphs
PublikacjaIn 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...
-
Equitable coloring of hypergraphs
PublikacjaA 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...
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
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...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
A polynomial algorithm for finding T-span of generalized cacti.
PublikacjaW 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.
PublikacjaW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Recurrence scheme for FDTD-compatible discrete Green's function derived based on properties of Gauss hypergeometric function
PublikacjaIn this paper, the formulation of one-dimensional FDTD (Finite-difference time-domain)-compatible discrete Green's function (DGF) is derived based on the Gauss hypergeometric function (GHF). The properties of GHF make it possible to derive the recurrence scheme only in the time domain for the DGF generation. Furthermore, this recurrence scheme is valid for any stable time-step size and can be implemented using standard numerical...
-
Sub-optimal fault-tolerant control by means of discrete optimization
PublikacjaOpracowanie przedstawia metodę projektowania sterowania optymalnego i odpornego na uszkodzenia z zastosowaniem algorytmów optymalizacji dyskretnej. Poszukiwana trajektoria, jeśli istnieje, jest reprezentowana przez najtańszą ścieżkę w grafie przepływowym, kodującym właściwości danego procesu dynamicznego. Metoda umożliwia zdefiniowanie obszarów zastrzeżonych dla punktu pracy, mogących reprezentować uszkodzenia systemu wykryte wcześniej.
-
Stability analysis of interconnected discrete-time fractional-order LTI state-space systems
PublikacjaIn this paper, a stability analysis of interconnected discrete-time fractional-order (FO) linear time-invariant (LTI) state-space systems is presented. A new system is formed by interconnecting given FO systems using cascade, feedback, parallel interconnections. The stability requirement for such a system is that all zeros of a non-polynomial characteristic equation must be within the unit circle on the complex z-plane. The obtained...
-
Stability of softly switched multiregional dynamic output controllers with a static antiwindup filter: A discrete-time case
PublikacjaThis paper addresses the problem of model-based global stability analysis of discrete-time Takagi–Sugeno multiregional dynamic output controllers with static antiwindup filters. The presented analyses are reduced to the problem of a feasibility study of the Linear Matrix Inequalities (LMIs), derived based on Lyapunov stability theory. Two sets of LMIs are considered candidate derived from the classical common quadratic Lyapunov...
-
Inverse shadowing and related measures
PublikacjaWe 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...
-
Numerical solution of threshold problems in epidemics and population dynamics
PublikacjaA new algorithm is proposed for the numerical solution of threshold problems in epidemics and population dynamics. These problems are modeled by the delay-differential equations, where the delay function is unknown and has to be determined from the threshold conditions. The new algorithm is based on embedded pair of continuous Runge–Kutta method of order p = 4 and discrete Runge–Kutta method of order q = 3 which is used for the...
-
On–line Parameter and Delay Estimation of Continuous–Time Dynamic Systems
PublikacjaThe problem of on-line identification of non-stationary delay systems is considered. The dynamics of supervised industrial processes are usually modeled by ordinary differential equations. Discrete-time mechanizations of continuous-time process models are implemented with the use of dedicated finite-horizon integrating filters. Least-squares and instrumental variable procedures mechanized in recursive forms are applied for simultaneous...
-
Parameter and delay estimation of linear continuous-time systems
PublikacjaIn this paper the problem of on-line identification of non-stationary delay systems is considered. Dynamics of supervised industrial processes is usually described by ordinary differential equations. Discrete-time mechanization of their continuous-time representations is based on dedicated finite-horizon integrating filters. Least-squares and instrumental variable procedures implemented in recursive forms are applied for simultaneous...