CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Independent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes

by Chris Monica M., D. Little Femilin Jana
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 165 - Number 7
Year of Publication: 2017
Authors: Chris Monica M., D. Little Femilin Jana
10.5120/ijca2017913936

Chris Monica M., D. Little Femilin Jana . Independent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes. International Journal of Computer Applications. 165, 7 ( May 2017), 46-48. DOI=10.5120/ijca2017913936

@article{ 10.5120/ijca2017913936,
author = { Chris Monica M., D. Little Femilin Jana },
title = { Independent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes },
journal = { International Journal of Computer Applications },
issue_date = { May 2017 },
volume = { 165 },
number = { 7 },
month = { May },
year = { 2017 },
issn = { 0975-8887 },
pages = { 46-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume165/number7/27589-2017913936/ },
doi = { 10.5120/ijca2017913936 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:11:51.103871+05:30
%A Chris Monica M.
%A D. Little Femilin Jana
%T Independent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
%J International Journal of Computer Applications
%@ 0975-8887
%V 165
%N 7
%P 46-48
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W is called the independent resolving number and is denoted by ir(G). In this paper, we determine the independent resolving number of Fibonacci Cubes and Extended Fibonacci cubes.

References
  1. Saenpholphat, V., Zhang, P., Conditional resolvability of graphs: a survey. IJMMS vol. 38, pp. 1997–2017, 2003.
  2. Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffman and M. Mihalak, Network Discovery and Verification, IEEE Journal on Selected Areas in Communications, Vol.24, No. 12, pp. 2168-2181, 2006.
  3. Slater, P.J., Leaves of trees. Congr. Numer., 14, pp. 549–559, 1975.
  4. Y. Saad and M.H. Schultz, Topological Properties of Hypercubes, IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, 1988.
  5. Hsu, W. J., Fibonacci cubes - a new interconnection topology, IEEE Trans. Parallel and Distributed Systems, 4, no.1, pp. 3-12, 1993.
  6. Hsu, W. J., Fibonacci cubes - Properties of an Asymmetric Interconnection Topology, Proc. Inter. Conf. on Parallel Processing, pp. 1249-1268, 1991.
  7. J.Wu., Extended Fibonacci Cubes, IEEE Trans. Parallel and Distributed Systems, vol.8, no.12, pp. 1203-1210,1997.
  8. Ioana zelina, A survey on cycles embeddings in Fibonacci and extended Fibonacci cubes, Creative Math. & Inf., vol. 17, no. 3, pp. 548 – 554, 2008.
Index Terms

Computer Science
Information Sciences

Keywords

Resolving set Independent resolving number Fibonacci Cubes Extended Fibonacci Cubes Hamming distance.

Powered by PhDFocusTM