We investigate some new results for strongly multiplicative labeling of graph. We prove that the graph obtained by arbitrary supersubdivision of tree T , grid graph Pn × Pm, complete bipartite graph Km,n, Cn Pm and one-point union of m cycle of length n are strongly multiplicative.

The present paper introduces a new communication and load-balancing scheme based on a clustering of the grid which we use for the efficient parallelization of simulations on dynamically adaptive grids. With a partitioning based on space-filling curves (SFCs), this yields several advantageous properties regarding the memory requirements and load balancing. However, for such an SFC-based partitio...

In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to speed up the minimum cost route computation. The HiTi graph model provides a novel approach to abstracting and structuring a topographical road map in a hierarchical fashion. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a topographi...

Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid service matching graph based on the semantic similarity of function parameters and then an efficient search algorithm is presented to accomplish Grid service discovery. The experiment results show the algorithm proposed in t...

Let Rn denote the graph with vertex set consisting of the squares of an n × n grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook’s graph, and can also be thought of as the Cartesian product of two complete graphs of order n, or the line graph of the complete bipartite graph Kn,n. In this paper we compute the Smith group and critical grou...

A Hamiltonian path (cycle) of a graph is a simple path (cycle) which visits each vertex of the graph exactly once. The Hamiltonian path (cycle) problem is to determine whether a graph contains a Hamiltonian path (cycle). A graph is called Hamiltonian connected if there exists a Hamiltonian path between any two distinct vertices. Supergrid graphs were first introduced by us and include grid grap...