Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.

in this paper, we give a characterization of strongly jordan zero-product preserving maps on normed algebras as a generalization of  jordan zero-product preserving maps. in this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly jordan zero-product preserving maps are completely different. also, we prove that the direct p...

the ordinary tensor product of modules is defined using bilinear maps (bimorphisms), that are linear in eachcomponent. keeping this in mind, linton and banaschewski with nelson defined and studied the tensor product in an equational category and in a general (concrete) category k, respectively, using bimorphisms, that is, defined via the hom-functor on k. also, the so-called sesquilinear, or on...

‎‎The tensor product is the fundemental ingredient for extending one-dimensional techniques of filtering and compression in signal preprocessing to higher dimensions‎. ‎Woven frames play ‎ a crucial role in signal preprocessing and distributed data processing‎. Motivated by these facts, we have investigated the tensor product of woven frames and presented some of their properties. Besides...

A good promotional strategy encompasses advertising, sales promotion, public relations, and personal selling in order to communicate with their present and potential consumers (Kotler, 1994). Because they have been shown to have a significant sales impact, sales promotions are majorly employed in businesses. Application of consumer sales promotions in product management requires debate over its...

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.