Title of article :
The adjacency dimension of some path related trees
Author/Authors :
Hardany ، Elham Department of Mathematics - Faculty of Science - Imam Khomeini International University , Behtoei ، Ali Department of Mathematics - Faculty of Science - Imam Khomeini International University
From page :
369
To page :
386
Abstract :
‎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‎.
Keywords :
Adjacency resolving set‎ , ‎Adjacency dimension‎ , ‎Path‎ , ‎Broom‎ , ‎Tree‎
Journal title :
Journal of Mahani Mathematical Research Center
Journal title :
Journal of Mahani Mathematical Research Center
Record number :
2768968
Link To Document :
بازگشت