We present a construction that allows us to define limit object of Banach space decorated graph sequences in generalized homomorphism density sense. This general functional analytic framework provides universal language for various combinatorial notions. In particular it makes possible assign objects multigraph are convergent the sense node-and-edge numbers, and generalizes theory with compact ...

abstract in this paper, we study the generalized order- jacobsthal sequences modulo for and the generalized order-k jacobsthal-padovan sequence modulo for . also, we define the generalized order-k jacobsthal orbit of a k-generator group for and the generalized order-k jacobsthal-padovan orbit a k-generator group for . furthermore, we obtain the lengths of the periods of the generalized order-3 ...

We prove that for every d ≥ 3 the homomorphism order of the class of line graphs of finite graphs with maximal degree d is universal. This means that every finite or countably infinite partially ordered set may be represented by line graphs of graphs with maximal degree d ordered by the existence of a homomorphism.

let $mathcal {a} $ and $mathcal {b} $ be c$^*$-algebras. assume that $mathcal {a}$ is of real rank zero and unital with unit $i$ and $k>0$ is a real number. it is shown that if $phi:mathcal{a} tomathcal{b}$ is an additive map preserving $|cdot|^k$ for all normal elements; that is, $phi(|a|^k)=|phi(a)|^k $ for all normal elements $ainmathcal a$, $phi(i)$ is a projection, and there exists a posit...

the goal of this paper is to generalize the recently introduced summability method and introduce double statistical convergence of order  by using ideal. we also investigate certain properties of this convergence.

The set üS can be identified with the set of all base point preserving maps of $ into itself. SO(n)> acting on S as R with a point a t infinity, is also a set of base point preserving maps of S onto itself. This defines SO(n) C.tiS. The induced map in homotopy is called the /-homomorphism. If we allow n to go to infinity we have the stable /-homomorphism. By Bott 's results [3] 7Ty(50)=Z, i = —...

An order is dense if A < B implies A < C < B for some C. The homomorphism order of (nontrivial) graphs is known to be dense. Homomorphisms of trigraphs extend homomorphisms of graphs, and model many partitions of interest in the study of perfect graphs. We address the question of density of the homomorphism order for trigraphs. It turns out that there are gaps in the order, and we exactly chara...

In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices,  topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...

Homomorphisms are a useful model for a wide variety of combinatorial problems dealing with mappings and assignments, typified by scheduling and channel assignment problems. Homomorphism problems generalize graph colourings, and are in turn generalized by constraint satisfaction problems; they represent a robust intermediate class of problems – with greater modeling power than graph colourings, ...

A graph homomorphism is an edge preserving vertex mapping between two graphs. Locally constrained homomorphisms are those that behave well on the neighborhoods of vertices — if the neighborhood of any vertex of the source graph is mapped bijectively (injectively, surjectively) to the neighborhood of its image in the target graph, the homomorphism is called locally bijective (injective, surjecti...