نتایج جستجو برای: lexicographic product tensor product
تعداد نتایج: 320801 فیلتر نتایج به سال:
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this paper improved lower and upper bounds for ψk of the Cartesian and the direct product of paths are derived. It is shown that for ψ3 those bounds are tight. For the lexicographic produc...
We study the Riesz decomposition property types of the lexicographic product of two po-groups. Then we apply them to the study of pseudo effect algebras which can be decomposed into a comparable system of non-void slices indexed by some subgroup of real numbers. Finally, we present their representation by the lexicographic product.
the outcome of this research is a practical framework for “idea generation phase of new product development process based on customer knowledge”. in continue, the mentioned framework implemented in a part of iran n.a.b market and result in segmenting and profiling this market. also, the critical new product attributes and bases of communication message and promotion campaigns extracted. we have...
In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge-transitive and H is edgeless. If the first factor of G ◦H is non-trivial and complete, then G ◦H is edge-transitive if and only if H is the lexicogr...
Recently the invariant (copoint) pre-hull number ph(G) of a graph G that measures the nonconvexity of a convex space was introduced by Polat and Sabidussi in [18]. We introduce a similar invariant called convex pre-hull number which is a natural upper bound for the copoint pre-hull number and consider in this work both on the lexicographic product of graphs. We present exact values with respect...
Let G be a connected graph and H be an arbitrary graph. In this paper, we study the identifying codes of the lexicographic product G[H] of G and H. We first introduce two parameters of H, which are closely related to identifying codes of H. Then we provide the sufficient and necessary condition for G[H] to be identifiable. Finally, if G[H] is identifiable, we determine the minimum cardinality o...
There are four standard products of graphs: the direct product, the Cartesian product, the strong product and the lexicographic product. The chromatic number turned out to be an interesting parameter on all these products, except on the Cartesian one. A survey is given on the results concerning the chromatic number of the three relevant products. Some applications of product colorings are also ...
In the spirit of the Langlands proposal on Beyond Endoscopy we discuss the explicit relation between the Langlands functorial transfers and automorphic $L$-functions. It is well-known that the poles of the $L$-functions have deep impact to the Langlands functoriality. Our discussion also includes the meaning of the central value of the tensor product $L$-functions in terms of the Langl...
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...
in this paper we study the properties of derivations of a b, where a and b are simple separable c*-algebras, and a b is the c*-completion of a b with respect to a c*-norm yon a b and we will characterize the derivations of a b in terms of the derivations of a and b
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید