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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Shahid Bahonar University of Kerman
2025-01-01
|
| Series: | Journal of Mahani Mathematical Research |
| Subjects: | |
| Online Access: | https://jmmrc.uk.ac.ir/article_4501_18f407af7d61bab854c663f671bb11b8.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841560188110241792 |
|---|---|
| author | Elham Hardany Ali Behtoei |
| author_facet | Elham Hardany Ali Behtoei |
| author_sort | Elham Hardany |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-6ad572cc543a4cb5b3b1e762dcc6fdc4 |
| institution | Kabale University |
| issn | 2251-7952 2645-4505 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Shahid Bahonar University of Kerman |
| record_format | Article |
| series | Journal of Mahani Mathematical Research |
| spelling | doaj-art-6ad572cc543a4cb5b3b1e762dcc6fdc42025-01-04T19:30:18ZengShahid Bahonar University of KermanJournal of Mahani Mathematical Research2251-79522645-45052025-01-0114136938610.22103/jmmr.2024.22886.15764501The adjacency dimension of some path related treesElham Hardany0Ali Behtoei1Department of Mathematics, Faculty of Science, Imam Khomeini International University, P.O. Box: 34149-16818, Qazvin, IranDepartment of Mathematics, Faculty of Science, Imam Khomeini International University, P.O. Box: 34149-16818, Qazvin, IranSince 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.https://jmmrc.uk.ac.ir/article_4501_18f407af7d61bab854c663f671bb11b8.pdfadjacency resolving setadjacency dimensionpathbroomtree |
| spellingShingle | Elham Hardany Ali Behtoei The adjacency dimension of some path related trees Journal of Mahani Mathematical Research adjacency resolving set adjacency dimension path broom tree |
| title | The adjacency dimension of some path related trees |
| title_full | The adjacency dimension of some path related trees |
| title_fullStr | The adjacency dimension of some path related trees |
| title_full_unstemmed | The adjacency dimension of some path related trees |
| title_short | The adjacency dimension of some path related trees |
| title_sort | adjacency dimension of some path related trees |
| topic | adjacency resolving set adjacency dimension path broom tree |
| url | https://jmmrc.uk.ac.ir/article_4501_18f407af7d61bab854c663f671bb11b8.pdf |
| work_keys_str_mv | AT elhamhardany theadjacencydimensionofsomepathrelatedtrees AT alibehtoei theadjacencydimensionofsomepathrelatedtrees AT elhamhardany adjacencydimensionofsomepathrelatedtrees AT alibehtoei adjacencydimensionofsomepathrelatedtrees |