2019/03/28 by Samuel G. Corregidor, Corregidor, Samuel G., Álvaro Martínez-Pérez +1 · 1 citation
Computer Science · Engineering · #05C90 Secondary 05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Primary 05C12 #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1903.11890
openalex publication_date 2019/03/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Given a graph G = (V,E), a set S ⊂ V is called a k-metric generator for G if any pair of different vertices of G is distinguished by at least k elements of S. A graph is k-metric dimensional if k is the largest integer such that there exists a k-metric generator for G. This paper studies some bounds on the number k for which a graph is k-metric dimensional.