Author, as appears in the article.: Estrada-Moreno, Alejandro;
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: Estrada Moreno, Alejandro
Keywords: Unicyclic graph Linear programming problem Landmarks K-metric generator K-metric dimensional graph K-metric dimension
Abstract: Given a connected graph G=(V(G),E(G)), a set S & SUBE;V(G) is said to be a k-metric generator for G if any pair of different vertices in V(G) is distinguished by at least k elements of S. A metric generator of minimum cardinality among all k-metric generators is called a k-metric basis and its cardinality is the k-metric dimension of G. We initially present a linear programming problem that describes the problem of finding the k-metric dimension and a k-metric basis of a graph G. Then we conducted a study on the k-metric dimension of a unicyclic graph.
Thematic Areas: Química Mathematics (miscellaneous) Mathematics (all) Mathematics General mathematics Engineering (miscellaneous) Computer science (miscellaneous) Astronomia / física
licence for use: https://creativecommons.org/licenses/by/3.0/es/
Author's mail: alejandro.estrada@urv.cat
Author identifier: 0000-0001-9767-2177
Record's date: 2024-07-27
Papper version: info:eu-repo/semantics/publishedVersion
Link to the original source: https://www.mdpi.com/2227-7390/9/21/2789
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Papper original source: Mathematics. 9 (21):
APA: Estrada-Moreno, Alejandro; (2021). The k-Metric Dimension of a Unicyclic Graph. Mathematics, 9(21), -. DOI: 10.3390/math9212789
Article's DOI: 10.3390/math9212789
Entity: Universitat Rovira i Virgili
Journal publication year: 2021
Publication Type: Journal Publications
Repositori URV