|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 165 - Issue 7 |
| Published: May 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 },
year = { 2017 },
volume = { 165 },
number = { 7 },
pages = { 46-48 },
doi = { 10.5120/ijca2017913936 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2017
%A Chris Monica M.
%A D. Little Femilin Jana
%T Independent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes%T
%J International Journal of Computer Applications
%V 165
%N 7
%P 46-48
%R 10.5120/ijca2017913936
%I Foundation of Computer Science (FCS), NY, USA
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.