On the \(k\)-partition dimension of graphs
From MaRDI portal
Publication:2285123
DOI10.1016/j.tcs.2018.09.022zbMath1437.05195arXiv1805.04966OpenAlexW2963298221MaRDI QIDQ2285123
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.04966
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-metric dimension of the lexicographic product of graphs
- \(k\)-metric resolvability in graphs
- The simultaneous metric dimension of families composed by lexicographic product graphs
- The metric dimension of metric spaces
- The partition dimension of strong product graphs and Cartesian product graphs
- On the strong partition dimension of graphs
- Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs
- Simultaneous resolvability in families of corona product graphs
- The \(k\)-metric dimension of corona product graphs
- The simultaneous strong metric dimension of graph families
- The strong metric dimension of graphs and digraphs
- The simultaneous metric dimension of graph families
- Weak total resolvability in graphs
- On minimum metric dimension of honeycomb networks
- Resolvability and the upper dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- Computing the \(k\)-metric dimension of graphs
- On the strong metric dimension of corona product graphs and join graphs
- The partition dimension of a graph
- The Local metric dimension of the lexicographic product of graphs
- The simultaneous local metric dimension of graph families
- The partition dimension of Cayley digraphs
- Landmarks in graphs
- On the partition dimension of trees
- Minimum Fault-Tolerant, local and strong metric dimension of graphs
- Metric bases in digital geometry
- Resolving domination in graphs
- Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
- Weak total resolving sets in graphs
- On the k-metric dimension of metric spaces
- On the adjacency dimension of graphs
- On Metric Generators of Graphs
- Strong resolving partitions for strong product graphs and Cartesian product graphs
This page was built for publication: On the \(k\)-partition dimension of graphs