Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "decomposable" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    Decomposable hulls of multifunctions
    Autorzy:
    Nowak, Andrzej
    Rom, Celina
    Powiązania:
    https://bibliotekanauki.pl/articles/729501.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    decomposable set
    multifunction
    decomposable hull
    Opis:
    Let F be a multifunction with values in Lₚ(Ω, X). In this note, we study which regularity properties of F are preserved when we consider the decomposable hull of F.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2002, 22, 2; 233-241
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The {−2,−1}-Selfdual and Decomposable Tournaments
    Autorzy:
    Boudabbous, Youssef
    Ille, Pierre
    Powiązania:
    https://bibliotekanauki.pl/articles/31342271.pdf
    Data publikacji:
    2018-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    tournament
    decomposable
    selfdual
    Opis:
    We only consider finite tournaments. The dual of a tournament is obtained by reversing all the arcs. A tournament is selfdual if it is isomorphic to its dual. Given a tournament T, a subset X of V (T) is a module of T if each vertex outside X dominates all the elements of X or is dominated by all the elements of X. A tournament T is decomposable if it admits a module X such that 1 < |X| < |V (T)|. We characterize the decomposable tournaments whose subtournaments obtained by removing one or two vertices are selfdual. We deduce the following result. Let T be a non decomposable tournament. If the subtournaments of T obtained by removing two or three vertices are selfdual, then the subtournaments of T obtained by removing a single vertex are not decomposable. Lastly, we provide two applications to tournaments reconstruction.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 3; 743-789
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On arbitrarily vertex decomposable unicyclic graphs with dominating cycle
    Autorzy:
    Cichacz, Sylwia
    Zioło, Irmina
    Powiązania:
    https://bibliotekanauki.pl/articles/743581.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    arbitrarily vertex decomposable graph
    dominating cycle
    Opis:
    A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of positive integers such that $∑^k_{i=1} n_i = n$, there exists a partition (V₁,...,Vₖ) of vertex set of G such that for every i ∈ {1,...,k} the set $V_i$ induces a connected subgraph of G on $n_i$ vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We also characterize all such graphs with at most four hanging vertices such that exactly two of them have a common neighbour.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2006, 26, 3; 403-412
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A path(ological) partition problem
    Autorzy:
    Broere, Izak
    Dorfling, Michael
    Dunbar, Jean
    Frick, Marietjie
    Powiązania:
    https://bibliotekanauki.pl/articles/744209.pdf
    Data publikacji:
    1998
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    vertex partition
    τ-partitionable
    decomposable graph
    Opis:
    Let τ(G) denote the number of vertices in a longest path of the graph G and let k₁ and k₂ be positive integers such that τ(G) = k₁ + k₂. The question at hand is whether the vertex set V(G) can be partitioned into two subsets V₁ and V₂ such that τ(G[V₁] ) ≤ k₁ and τ(G[V₂] ) ≤ k₂. We show that several classes of graphs have this partition property.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1998, 18, 1; 113-125
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Selection theorem in L¹
    Autorzy:
    Nowak, Andrzej
    Rom, Celina
    Powiązania:
    https://bibliotekanauki.pl/articles/729598.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    multifunction
    measurable selector
    continuous selector
    decomposable set
    Opis:
    Let F be a multifunction from a metric space X into L¹, and B a subset of X. We give sufficient conditions for the existence of a measurable selector of F which is continuous at every point of B. Among other assumptions, we require the decomposability of F(x) for x ∈ B.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2006, 26, 1; 123-127
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On a partial Hadamard fractional integral inclusion
    Autorzy:
    Cernea, Aurelian
    Powiązania:
    https://bibliotekanauki.pl/articles/729602.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Hadamard fractional derivative
    integral inclusion
    decomposable set
    Opis:
    We study a class of nonconvex Hadamard fractional integral inclusions and we establish some Filippov type existence results.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2016, 36, 2; 141-153
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
    Autorzy:
    Meng, Wei
    Powiązania:
    https://bibliotekanauki.pl/articles/32083838.pdf
    Data publikacji:
    2021-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    local tournament
    round-decomposable
    arc-disjoint Hamiltonian paths
    Opis:
    Thomassen, [Edge-disjoint Hamiltonian paths and cycles in tournaments, J. Combin. Theory Ser. B 28 (1980) 142–163] proved that every strong tournament has a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal vertices if and only if it is not an almost transitive tournament of odd order. As a subclass of local tournaments, Li et al. [Arc-disjoint Hamiltonian cycles in round decomposable local tournaments, Discuss. Math. Graph Theory 38 (2018) 477–490] confirmed the existence of such two paths in 2-strong round decomposable local tournaments. In this paper, we show that every strong, but not 2-strong, round decomposable local tournament contains a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal vertices except for three classes of digraphs. Thus Thomassen's result is partly extended to round decomposable local tournaments. In addition, we also characterize strong round digraphs which contain a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal vertices.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2021, 41, 1; 297-310
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The decomposability of additive hereditary properties of graphs
    Autorzy:
    Broere, Izak
    Dorfling, Michael
    Powiązania:
    https://bibliotekanauki.pl/articles/743814.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    property of graphs
    additive
    hereditary
    decomposable property of graphs
    Opis:
    An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. If ₁,...,ₙ are properties of graphs, then a (₁,...,ₙ)-decomposition of a graph G is a partition E₁,...,Eₙ of E(G) such that $G[E_i]$, the subgraph of G induced by $E_i$, is in $_i$, for i = 1,...,n. We define ₁ ⊕...⊕ ₙ as the property {G ∈ : G has a (₁,...,ₙ)-decomposition}. A property is said to be decomposable if there exist non-trivial hereditary properties ₁ and ₂ such that = ₁⊕ ₂. We study the decomposability of the well-known properties of graphs ₖ, ₖ, ₖ, ₖ, ₖ, ₖ and $ ^{p}$.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2000, 20, 2; 281-291
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Arbitrarily vertex decomposable caterpillars with four or five leaves
    Autorzy:
    Cichacz, Sylwia
    Görlich, Agnieszka
    Marczyk, Antoni
    Przybyło, Jakub
    Woźniak, Mariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/743967.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    arbitrarily vertex decomposable graphs
    trees
    caterpillars
    star-like trees
    Opis:
    A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a₁,...,aₖ) of positive integers such that a₁+...+aₖ = n there exists a partition (V₁,...,Vₖ) of the vertex set of G such that for each i ∈ {1,...,k}, $V_i$ induces a connected subgraph of G on $a_i$ vertices. D. Barth and H. Fournier showed that if a tree T is arbitrarily vertex decomposable, then T has maximum degree at most 4. In this paper we give a complete characterization of arbitrarily vertex decomposable caterpillars with four leaves. We also describe two families of arbitrarily vertex decomposable trees with maximum degree three or four.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2006, 26, 2; 291-305
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Properties of set-valued stochastic integrals
    Autorzy:
    Motyl, Jerzy
    Syga, Joachim
    Powiązania:
    https://bibliotekanauki.pl/articles/729672.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    decomposable set
    Hausdorff metric
    predictable set-valued process
    square-integrable martingale
    semimartingale
    Opis:
    We introduce set-valued stochastic integrals driven by a square-integrable martingale and by a semimartingale. We investigate properties of both integrals.
    Źródło:
    Discussiones Mathematicae Probability and Statistics; 2006, 26, 1; 83-103
    1509-9423
    Pojawia się w:
    Discussiones Mathematicae Probability and Statistics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
    Autorzy:
    Li, Ruijuan
    Han, Tingting
    Powiązania:
    https://bibliotekanauki.pl/articles/31342322.pdf
    Data publikacji:
    2018-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    locally semicomplete digraph
    local tournament
    round decomposable
    arc-disjoint
    Hamiltonian cycle
    Hamiltonian path
    Opis:
    Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and the in-neighbours of x induce a semicomplete digraph. A locally semicomplete digraph without 2-cycle is a local tournament. In 2012, Bang-Jensen and Huang [J. Combin Theory Ser. B 102 (2012) 701–714] concluded that every 2-arc-strong locally semicomplete digraph which is not the second power of an even cycle has two arc-disjoint strong spanning subdigraphs, and proposed the conjecture that every 3-strong local tournament has two arc-disjoint Hamiltonian cycles. According to Bang-Jensen, Guo, Gutin and Volkmann, locally semicomplete digraphs have three subclasses: the round decomposable; the non-round decomposable which are not semicomplete; the non-round decomposable which are semicomplete. In this paper, we prove that every 3-strong round decomposable locally semicomplete digraph has two arc-disjoint Hamiltonian cycles, which implies that the conjecture holds for the round decomposable local tournaments. Also, we characterize the 2-strong round decomposable local tournaments each of which contains a Hamiltonian path P and a Hamiltonian cycle arc-disjoint from P.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 2; 477-490
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Existence results for ϕ-Laplacian Dirichlet BVP of differential inclusions with application to control theory
    Autorzy:
    Djebali, Smaïl
    Ouahab, Abdelghani
    Powiązania:
    https://bibliotekanauki.pl/articles/729271.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    differential inclusions
    boundary value problem
    fixed point
    compact
    convex
    nonconvex
    decomposable
    continuous selection
    controllability
    Opis:
    In this paper, we study ϕ-Laplacian problems for differential inclusions with Dirichlet boundary conditions. We prove the existence of solutions under both convexity and nonconvexity conditions on the multi-valued right-hand side. The nonlinearity satisfies either a Nagumo-type growth condition or an integrably boundedness one. The proofs rely on the Bonhnenblust-Karlin fixed point theorem and the Bressan-Colombo selection theorem respectively. Two applications to a problem from control theory are provided.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2010, 30, 1; 23-49
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Arbitrarily Partitionable {2K2, C4}-Free Graphs
    Autorzy:
    Liu, Fengxia
    Wu, Baoyindureng
    Meng, Jixiang
    Powiązania:
    https://bibliotekanauki.pl/articles/32361721.pdf
    Data publikacji:
    2022-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    arbitrarily partitionable graphs
    arbitrarily vertex decomposable
    threshold graphs
    {2 K 2, C 4 }-free graphs
    Opis:
    A graph G = (V, E) of order n is said to be arbitrarily partitionable if for each sequence λ = (λ1, λ2, …, λp) of positive integers with λ1 + … +λp = n, there exists a partition (V1, V2, … , Vp) of the vertex set V such that Vi induces a connected subgraph of order λi in G for each i ∈ {1, 2, …, p}. In this paper, we show that a threshold graph is arbitrarily partitionable if and only if it admits a perfect matching or a near perfect matching. We also give a necessary and sufficient condition for a {2K2, C4}-free graph being arbitrarily partitionable, as an extension for a result of Broersma, Kratsch and Woeginger [Fully decomposable split graphs, European J. Combin. 34 (2013) 567–575] on split graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 2; 485-500
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-13 z 13

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies