Independent resolving sets in graphs
Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence of independent resolving sets in Cartesian pr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2021-05-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09728600.2021.1963643 |
| _version_ | 1818922737855365120 |
|---|---|
| author | B. Suganya S. Arumugam |
| author_facet | B. Suganya S. Arumugam |
| author_sort | B. Suganya |
| collection | DOAJ |
| description | Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence of independent resolving sets in Cartesian product and corona of graphs. |
| first_indexed | 2024-12-20T01:58:18Z |
| format | Article |
| id | doaj.art-c8dfd0ca7c06458fae3330c4f99264b0 |
| institution | Directory Open Access Journal |
| issn | 0972-8600 2543-3474 |
| language | English |
| last_indexed | 2024-12-20T01:58:18Z |
| publishDate | 2021-05-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj.art-c8dfd0ca7c06458fae3330c4f99264b02022-12-21T19:57:25ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742021-05-0118210610910.1080/09728600.2021.19636431963643Independent resolving sets in graphsB. Suganya0S. Arumugam1Kalasalingam Academy of Research and Education, National Centre for Advanced Research in Discrete MathematicsKalasalingam Academy of Research and Education, National Centre for Advanced Research in Discrete MathematicsLet be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence of independent resolving sets in Cartesian product and corona of graphs.http://dx.doi.org/10.1080/09728600.2021.1963643resolving setindependent resolving setmetric dimensioncoronacartesian product |
| spellingShingle | B. Suganya S. Arumugam Independent resolving sets in graphs AKCE International Journal of Graphs and Combinatorics resolving set independent resolving set metric dimension corona cartesian product |
| title | Independent resolving sets in graphs |
| title_full | Independent resolving sets in graphs |
| title_fullStr | Independent resolving sets in graphs |
| title_full_unstemmed | Independent resolving sets in graphs |
| title_short | Independent resolving sets in graphs |
| title_sort | independent resolving sets in graphs |
| topic | resolving set independent resolving set metric dimension corona cartesian product |
| url | http://dx.doi.org/10.1080/09728600.2021.1963643 |
| work_keys_str_mv | AT bsuganya independentresolvingsetsingraphs AT sarumugam independentresolvingsetsingraphs |