Abstract
Little is known about the partition dimension of infinite graphs. Tomescu studied graphs where the set of vertices is the set of points of the integer lattice. We generalize these graphs and present several exact values, lower bounds and upper bounds on the partition dimension of infinite graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 433-442 |
| Number of pages | 10 |
| Journal | Mathematical Reports |
| Volume | 24-74 |
| Issue number | 3 |
| Publication status | Published - 2022 |
Keywords
- Partition dimension
- distance
- infinite graph
ASJC Scopus subject areas
- Analysis
- Algebra and Number Theory
- Geometry and Topology
- Applied Mathematics