A method to construct graphs with certain partition dimension
From MaRDI portal
Publication:5009952
DOI10.5614/ejgta.2019.7.2.5zbMath1467.05063OpenAlexW2980666075MaRDI QIDQ5009952
D. O. Haryeni, Edy Tri Baskoro, S. W. Saputro
Publication date: 23 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2019.7.2.5
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The partition dimension of strong product graphs and Cartesian product graphs
- A note on the partition dimension of Cartesian product graphs
- Resolvability in graphs and the metric dimension of a graph
- On the partition dimension of two-component graphs
- The partition dimension of a graph
- On the partition dimension of a class of circulant graphs
- The partition dimension of Cayley digraphs
- Discrepancies between metric dimension and partition dimension of a connected graph
- The Metric Dimension of Regular Bipartite Graphs
- On the metric dimension of some families of graphs
- On the partition dimension of unicyclic graphs
- Metric dimension of fullerene graphs
This page was built for publication: A method to construct graphs with certain partition dimension