نتایج جستجو برای: lexicographic product tensor product
تعداد نتایج: 320801 فیلتر نتایج به سال:
A set of vertices W resolves a graph G if every vertex is uniquely determined by its coordinate of distances to the vertices in W . The minimum cardinality of a resolving set of G is called themetric dimension of G. In this paper, we consider a graphwhich is obtained by the lexicographic product between two graphs. The lexicographic product of graphs G and H , which is denoted by G ◦ H , is the...
in this paper we define an order structure on the $p$-operator projective tensor product of herz algebras and we show that the canonical isometric isomorphism between $a_p(gtimes h)$ and $a_p(g)widehat{otimes}^p a_p(h)$ is an order isomorphism for amenable groups $g$ and $h$.
Let γb(G) denote the broadcast domination number for a graph G. In [Discrete Applied Math. 154 (2006), 59–75], Dunbar et al. determined the value of γb(G), where G is the Cartesian product of two paths. In this paper, we evaluate the value of γb(G), whenever G is the strong product, the direct product and the lexicographic product of two paths.
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
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. In this work, we introduce the notion of an irreducible dominating set, a variant of dominating set generalizing both minimal dominating sets and minimal total dominating sets. Based on this notion, we characterize the family of minimal dominating sets in a lexicographic product of two graphs and deriv...
The tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r simple tensors. Let s be a k-tensor and let t be an `-tensor. The tensor product of s and t is a (k + `)-tensor. Tensor rank is sub-multiplicative under the tensor product. We revisit the connection between restrictions and degenerations. A result of our study is that tensor rank is not in general...
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑ uv∈E(G) |dG(u)− dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G). In this paper we consider the irregularity of graphs under several graph operations including join, Cartesian product, direct product, strong product, corona product, lexicographic product, disjunction and symmetric difference. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید