let g be a simple connected graph. the generalized polarity wiener index ofg is defined as the number of unordered pairs of vertices of g whosedistance is k. some formulas are obtained for computing the generalizedpolarity wiener index of the cartesian product and the tensor product ofgraphs in this article.

in this paper, some categorical properties of the category ${bf cpo}_{{bf act}text{-}s}$ of all {cpo $s$-acts}, cpo's equipped with actions of a monoid $s$ on them, and strict continuous action-preserving maps between them is considered. in particular, we describe products and coproducts in this category, and consider monomorphisms and epimorphisms. also, we show that the forgetful functor from...

let $g$ be a connected graph. the multiplicative zagreb eccentricity indices of $g$ are defined respectively as ${bf pi}_1^*(g)=prod_{vin v(g)}varepsilon_g^2(v)$ and ${bf pi}_2^*(g)=prod_{uvin e(g)}varepsilon_g(u)varepsilon_g(v)$, where $varepsilon_g(v)$ is the eccentricity of vertex $v$ in graph $g$ and $varepsilon_g^2(v)=(varepsilon_g(v))^2$. in this paper, we present some bounds of the multi...

a modular $k$-coloring, $kge 2,$ of a graph $g$ without isolated vertices is a coloring of the vertices of $g$ with the elements in $mathbb{z}_k$ having the property that for every two adjacent vertices of $g,$ the sums of the colors of the neighbors are different in $mathbb{z}_k.$ the minimum $k$ for which $g$ has a modular $k-$coloring is the modular chromatic number of $g.$ except for some s...

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...

‎ 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...

a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$‎. ‎a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$‎. ‎a geodetic dominating set $s$ is both a geodetic and a dominating set‎. ‎the geodetic (domination‎, ‎geodetic domination) number...

An intention of MapReduce Sets for Cartesian product expressions analysis has to suggest criteria how Cartesian product expressions in Cartesian product data can be defined in a meaningful way and how they should be compared. Similitude based MapReduce Sets for Cartesian product Expression Analysis and MapReduce Sets for Assignment is expected to adhere to fundamental principles of the scientif...

in this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. we present some sufficient and necessary conditions for $gbox h$ being hamilton-connected when $g$ is a hamilton-connected graph and $h$ is a tree or $g$ is a hamiltonian graph and $h$ is $k_2$.

In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].