Graph embeddings play a significant role in the design and analysis of parallel algorithms. It is a mapping of the topological structure of a guest graph G into a host graph H, which is represented as a one-to-one mapping from the vertex set of the guest graph to the vertex set of the host graph. In multiprocessing systems, the interconnection networks enhance the efficient communication between the components in the system. Obtaining minimum wirelength in embedding problems is significant in the designing of networks and simulating one architecture by another. In this paper, we determine the wirelength of embedding 3-ary n-cubes into cylinders and certain trees.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The purpose of the paper is to study the uniqueness of entire and meromorphic functions sharing a small function with finite weight. The results of the paper improve and extend some recent results due to Abhijit Banerjee and Pulak Sahoo [3].
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.