Independent resolving sets in graphs

Autor:	Subramanian Arumugam, B. Suganya
Rok vydání:	2021
Předmět:	independent resolving set resolving set Cartesian product metric dimension Metric dimension Combinatorics symbols.namesake QA1-939 symbols Discrete Mathematics and Combinatorics Order (group theory) cartesian product Resolving set corona Mathematics Connectivity
Zdroj:	AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 2, Pp 106-109 (2021)
ISSN:	2543-3474 0972-8600
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:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb5d4ff154e76658c4f8da97227dcd2c https://doi.org/10.1080/09728600.2021.1963643 Zobrazit plný text záznamu