Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
From MaRDI portal
Publication:4981156
DOI10.1007/978-3-319-06686-8_12zbMath1408.05048OpenAlexW2104230974MaRDI QIDQ4981156
Henning Fernau, Juan Alberto Rodríguez-Velázquez
Publication date: 24 June 2014
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_12
Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Is it possible to determine a point lying in a simplex if we know the distances from the vertices?, The local metric dimension of strong product graphs, Complexity of metric dimension on planar graphs, On adjacency metric dimension of some families of graph, The simultaneous metric dimension of families composed by lexicographic product graphs, Graphs with constant adjacency dimension, The adjacency dimension of graphs, On the super domination number of lexicographic product graphs, On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results, Italian domination in rooted product graphs, Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs, Computing the metric dimension of a graph from primary subgraphs, The Local metric dimension of the lexicographic product of graphs, Simultaneous resolvability in families of corona product graphs, On the \(k\)-partition dimension of graphs, Alternative parameterizations of \textsc{Metric Dimension}, Local metric dimension for graphs with small clique numbers, The simultaneous local metric dimension of graph families, Computing the metric dimension for chain graphs, On a conjecture about the local metric dimension of graphs
