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-15 z 21
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 some families of arbitrarily vertex decomposable spiders
Autorzy:
Juszczyk, T.
Zioło, I. A.
Powiązania:
https://bibliotekanauki.pl/articles/254779.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
arbitrarily vertex decomposable graph
trees
Opis:
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that [formula], there exists a partition (V1, . . . , Vk) of the vertex set of G such that for every i ∈ {1, . . . , k} the set Vi induces a connected subgraph of G on ni vertices. A spider is a tree with one vertex of degree at least 3. We characterize two families of arbitrarily vertex decomposable spiders which are homeomorphic to stars with at most four hanging edges.
Źródło:
Opuscula Mathematica; 2010, 30, 2; 147-154
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
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ł:
Inverse limits on intervals using unimodal bonding maps having only periodic points whose periods are all the powers of two
Autorzy:
Ingram, W.
Roe, Robert
Powiązania:
https://bibliotekanauki.pl/articles/965889.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
hereditarily decomposable continuum
logistic mapping
inverse limit
Opis:
We derive several properties of unimodal maps having only periodic points whose period is a power of 2. We then consider inverse limits on intervals using a single strongly unimodal bonding map having periodic points whose only periods are all the powers of 2. One such mapping is the logistic map, $f_λ(x)$ = 4λx(1-x) on [f(λ),λ], at the Feigenbaum limit, λ ≈ 0.89249. It is known that this map produces an hereditarily decomposable inverse limit with only three topologically different subcontinua. Other examples of such maps are given and it is shown that any two strongly unimodal maps with periodic point whose only periods are all the powers of 2 produce homeomorphic inverse limits whenever each map has the additional property that the critical point lies in the closure of the orbit of the right endpoint of the interval.
Źródło:
Colloquium Mathematicum; 1999, 81, 1; 51-61
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recursively arbitrarily vertex-decomposable graphs
Autorzy:
Baudon, O.
Gilbert, F.
Woźniak, M.
Powiązania:
https://bibliotekanauki.pl/articles/255981.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
arbitrary vertex decomposable (AVD) graph
recursively AVD graphs
Opis:
A graph G = (V, E) is arbitrarily vertex decomposable if for any sequence ϒ of positive integers adding up to/V/, there is a sequence of vertex-disjoint subsets of V whose orders are given by ϒ, and which induce connected graphs. The main aim of this paper is to study the recursive version of this problem. We present a solution for trees, suns, and partially for a class of 2-connected graphs called balloons.
Źródło:
Opuscula Mathematica; 2012, 32, 4; 689-706
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
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ł:
Local irregularity conjecture for 2-multigraphs versus cacti
Autorzy:
Grzelec, Igor
Woźniak, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/29519642.pdf
Data publikacji:
2024
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
locally irregular coloring
decomposable
cactus graphs
2-multigraphs
Opis:
A multigraph is locally irregular if the degrees of the end-vertices of every multiedge are distinct. The locally irregular coloring is an edge coloring of a multigraph G such that every color induces a locally irregular submultigraph of G. A locally irregular colorable multigraph G is any multigraph which admits a locally irregular coloring. We denote by lir(G) the locally irregular chromatic index of a multigraph G, which is the smallest number of colors required in the locally irregular coloring of the locally irregular colorable multigraph G. In case of graphs the definitions are similar. The Local Irregularity Conjecture for 2-multigraphs claims that for every connected graph G, which is not isomorphic to K2, multigraph 2G obtained from G by doubling each edge satisfies lir(2G) ≤ 2. We show this conjecture for cacti. This class of graphs is important for the Local Irregularity Conjecture for 2-multigraphs and the Local Irregularity Conjecture which claims that every locally irregular colorable graph G satisfies lir(G) ≤ 3. At the beginning it has been observed that all not locally irregular colorable graphs are cacti. Recently it has been proved that there is only one cactus which requires 4 colors for a locally irregular coloring and therefore the Local Irregularity Conjecture was disproved.
Źródło:
Opuscula Mathematica; 2024, 44, 1; 49-65
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
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ł:
A note of arbitrarily vertex decomposable graphs
Autorzy:
Marczyk, A.
Powiązania:
https://bibliotekanauki.pl/articles/254919.pdf
Data publikacji:
2006
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
arbitrarily vertex decomposable graphs
traceable graphs
independence number
perfect matching
Opis:
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1,..., nk) of positive integers such that n1 + ... + nk = n there exists a partition (V1,..., Vk) of the vertex set of G such that for each i ∈ {1,..., k}, Vi induces a connected subgraph of G on ni vertices. In this paper we show that if G is a two-connected graph on n vertices with the independence number at most ⌈n/2⌉ and such that the degree sum of any pair of non-adjacent vertices is at least n - 3, then G is arbitrarily vertex decomposable. We present another result for connected graphs satisfying a similar condition, where the bound n - 3 is replaced by n - 2.
Źródło:
Opuscula Mathematica; 2006, 26, 1; 109-118
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A continuous-time distributed algorithm for solving a class of decomposable nonconvex quadratic programming
Autorzy:
Zhao, Y.
Liu, Q.
Powiązania:
https://bibliotekanauki.pl/articles/91832.pdf
Data publikacji:
2018
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
decomposable nonconvex quadratic programming
multi-agent network
consensus
Lyapunov method
Opis:
In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic programming, even if the objective function is nonconvex, the algorithm can still perform well under an extra condition combining with the objective, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 283-291
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 21

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