On Certain Connected Resolving Parameters of Hypercube Networks

HTML  Download Download as PDF (Size: 144KB)  PP. 473-477  
DOI: 10.4236/am.2012.35071    4,895 Downloads   8,045 Views  Citations

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.

Share and Cite:

B. Rajan, A. William, I. Rajasingh and S. Prabhu, "On Certain Connected Resolving Parameters of Hypercube Networks," Applied Mathematics, Vol. 3 No. 5, 2012, pp. 473-477. doi: 10.4236/am.2012.35071.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.