Independent resolving sets in graphs
| Autor: | B. Suganya, S. Arumugam |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 2, Pp 106-109 (2021) |
| Druh dokumentu: | article |
| ISSN: | 0972-8600 2543-3474 09728600 |
| DOI: | 10.1080/09728600.2021.1963643 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|