Abstract—In graph theory, different types of products of two graphs had been studied, e.g., Cartesian product, Tensor product, Strong product, etc. In this paper we generalize the concept of Cartesian product of graphs.We define 2 Cartesian product and more generally r Cartesian product of two graphs. We study these product mainly for path graphs. We also discuss connectedness of the new graph.

‎ in the present article‎, ‎we study some categorical properties of the category {$bf‎ cpo_{sep}$-$s$} of all {separately strict $s$-cpo's}; cpo's equipped with‎ a compatible right action of a separately strict cpo-monoid $s$ which is‎ strict continuous in each component‎. ‎in particular‎, we show that this category is reflective and coreflective in the‎ category of $s$-cpo's‎, ‎find the free a...

If we follow a traditional reading of Descartes and throw in some of our favorite German philosophers (Kant, Husserl and Heidegger, for instance) we can isolate a doctrinal current that says that the pure intellect has no immediate access to the extra-mental world. This reduction of experience to reason forces the question of the external world’s existence, leading to Heidegger’s assertion that...

Cartesian granule features are derived features that are formed over the cross product of words that linguistically partition the universes of the constituent input features. Both classification and prediction problems can be modelled quite naturally in terms of Cartesian granule features incorporated into rule-based models. The induction of Cartesian granule feature models involves discovering...