Pages that link to "Item:Q4981156"

The following pages link to Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results (Q4981156):

Displayed 10 items.

• Is it possible to determine a point lying in a simplex if we know the distances from the vertices? (Q268543) ‎ (← links)
• Complexity of metric dimension on planar graphs (Q314819) ‎ (← links)
• The simultaneous metric dimension of families composed by lexicographic product graphs (Q343771) ‎ (← links)
• Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs (Q503630) ‎ (← links)
• Computing the metric dimension of a graph from primary subgraphs (Q503686) ‎ (← links)
• Simultaneous resolvability in families of corona product graphs (Q723627) ‎ (← links)
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) ‎ (← links)
• Computing the metric dimension for chain graphs (Q2346556) ‎ (← links)
• On the super domination number of lexicographic product graphs (Q2420416) ‎ (← links)
• The local metric dimension of strong product graphs (Q2631070) ‎ (← links)