The adjacency dimension of some path related trees
Since the problem of computing the adjacency dimension of a graph is NP-hard, finding the adjacency dimension of special classes of graphs or obtaining good bounds on this invariant is valuable. In this paper we determine the properties of each adjacency resolving set of paths. Then, by using these properties, we determine the adjacency dimension of broom and double broom graphs.
Institutions
- Imam Khomeini International University (IR)
Publication Details
- Journal
- SHILAP Revista de lepidopterología
- Published
- 2025-01-01
- DOI
- https://doi.org/10.22103/jmmr.2024.22886.1576
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00