The adjacency dimension of some path related trees

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 ‎usin...

Full description

Saved in:
Bibliographic Details
Main Authors: Elham Hardany, Ali Behtoei
Format: Article
Language:English
Published: Shahid Bahonar University of Kerman 2025-01-01
Series:Journal of Mahani Mathematical Research
Subjects:
adjacency resolving set‎
‎adjacency dimension‎
‎path‎
‎broom‎
‎tree‎
Online Access:https://jmmrc.uk.ac.ir/article_4501_18f407af7d61bab854c663f671bb11b8.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items