A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If G is a graph, then sg(G) is the cardinality of a smallest vertex subset S, such that one can assign a fixed geodesic to each pair {x, y} ⊆ S so that these (|S| 2 ) geodesics cover all the vertices of G. In this paper, the strong geodetic problem is studied on Cartesian product graphs. A ...

Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. A bipolar fuzzy graph structure is a generalization of a bipolar fuzzy graph. In this paper, we present several different types of operations, including composition, Cartesian product, strong product, cross product, and lexicographic product on ...

Use vi , i , i , i to denote order, connectivity, edge-connectivity and minimum degree of a graphGi for i=1, 2, respectively. For the connectivity and the edge-connectivity of the Cartesian product graph, up to now, the best results are (G1×G2) 1+ 2 and (G1×G2) 1+ 2. This paper improves these results by proving that (G1×G2) min{ 1+ 2, 2+ 1} and (G1×G2)= min{ 1+ 2, 1v2, 2v1} ifG1 andG2 are conne...

The articles [7], [4], [10], [9], [5], [2], [3], [1], [6], and [8] provide the notation and terminology for this paper. We adopt the following rules: X , Y denote non empty metric spaces, x1, y1, z1 denote elements of X , and x2, y2, z2 denote elements of Y . The scheme LambdaMCART deals with non empty sets A , B, C and a 4-ary functor F yielding an element of C , and states that: There exists ...

Most often, in a categorical semantics for a programming language, the substitution of terms is expressed by composition and finite products. However this does not deal with the order of evaluation of arguments, which may have major consequences when there are side-effects. In this paper Cartesian effect categories are introduced for solving this issue, and they are compared with strong monads,...

We show that the character space of the vector-valued Lipschitz algebra $Lip^{alpha}(X, E)$ of order $alpha$ is homeomorphic to the cartesian product $Xtimes M_E$ in the product topology, where $X$ is a compact metric space and $E$ is a unital commutative Banach algebra. We also characterize the form of each character on $Lip^{alpha}(X, E)$. By appealing to the injective tensor product, we the...