Article citationsMore>>

P. Manuel, M. I. Abd-El-Barr, I. Rajasingh and B. Rajan, “An Efficient Representation of Benes Networks and Its Applications,” Journal of Discrete Algorithms, Vol. 6, No. 1, 2008, pp. 11-19. doi:10.1016/j.jda.2006.08.003

has been cited by the following article:

• TITLE: On Certain Connected Resolving Parameters of Hypercube Networks

  AUTHORS: Bharati Rajan, Albert William, Indra Rajasingh, S. Prabhu

  KEYWORDS: Resolving Set; Basis; Path Resolving Set; Star Resolving Set; Hypercube Network

  JOURNAL NAME: Applied Mathematics, Vol.3 No.5, May 16, 2012

  ABSTRACT: Given a graph , a set is a resolving set if for each pair of distinct vertices there is a vertex such that . A resolving set containing a minimum number of vertices is called a minimum resolving set or a basis for . The cardinality of a minimum resolving set is called the resolving number or dimension of and is denoted by . A resolving set is said to be a star resolving set if it induces a star, and a path resolving set if it induces a path. The minimum cardinality of these sets, denoted respectively by and are called the star resolving number and path resolving number. In this paper we investigate these re-solving parameters for the hypercube networks.