A (d,h)-decomposition of a graph G is an order pair (D,H) such that H subgraph where has the maximum degree at most h and D acyclic orientation G−E(H) out-degree d. (d,h)-decomposable if (d,h)-decomposition. Let be embeddable in surface nonnegative characteristic. It known (d,h)-decomposable, then h-defective d+1-choosable. In this paper, we investigate graphs prove following four results. (1) ...

As appropriate generalizations of convex combinations with uncountably many terms, we introduce the so-called Choquet combinations, decomposable and as well their corresponding hull operators acting on power sets Lebesgue-Bochner spaces. We show that coincides in finite-dimensional setting, yet tends to be larger infinite dimensions. also provide a quantitative characterization hull, without an...

let r be a commutative ring with identity. let n and k be two submodules of a multiplication r-module m. thenn=im and k=jm for some ideals i and j of r. the product of n and k denoted by nk is defined by nk=ijm. inthis paper we characterize some particular cases of multiplication modules by using the product of submodules.

1 Analyzing General Properties of Network Deconvolution 3 1.1 Network deconvolution algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Optimality analysis of network deconvolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Modeling assumptions and intuitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

A graph G is ramdomly H–decomposable if every family of edge disjoint subgraphs of G, each subgraph isomorphic to H , can be extended to an H–decomposition of G. Let Pk denote a path of length k. In this paper we characterize all ramdomly P3– decomposable graphs and ramdomly P4–decomposable graphs. We also characterize all ramdomly Pk–decomposable graphs of size 2k where all vertices have even ...

We investigate the complexity of the tree share model of Dockins et al., which is used to reason about shared ownership of resources in concurrent programs. We obtain the precise Berman complexity for the first-order theory of the Boolean algebra of tree shares with constants, which is STA(∗, 2 O(1) , n)-complete. For the first-order theory over the “relativization” multiplication operator on t...

Following Beurling’s theorem the natural compressions of multiplication operator in classical $$L^2$$ space are to model spaces and their orthogonal complements. Here, two possibly different considered, hence asymmetric truncated Toeplitz dual operators investigated. The main purpose paper is characterize which intertwine unilateral shift.

The aim of the present paper is to completely characterize boundedness and compactness a sum operator defined by some more complex products composition, multiplication, mth iterated radial derivative operators from Bloch-type spaces weighted-type on unit ball. In applications, all ball are also characterized.