Metric dimension of star fan graph
Abstract Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set. Conditional resolving sets are obtained by imposing various const...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-01-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-024-83562-6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841559756162990080 |
|---|---|
| author | S. Prabhu D. Sagaya Rani Jeba Sudeep Stephen |
| author_facet | S. Prabhu D. Sagaya Rani Jeba Sudeep Stephen |
| author_sort | S. Prabhu |
| collection | DOAJ |
| description | Abstract Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set. Conditional resolving sets are obtained by imposing various constraints on resolving set. It is a fundamental parameter that provides insights into the structural properties and navigability of graphs, with diverse applications across different fields. This article focuses on identifying the metric dimension for a new network, star fan graph. |
| format | Article |
| id | doaj-art-9a0f3f85ac9e4968b632fc844e996b47 |
| institution | Kabale University |
| issn | 2045-2322 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj-art-9a0f3f85ac9e4968b632fc844e996b472025-01-05T12:15:49ZengNature PortfolioScientific Reports2045-23222025-01-011511810.1038/s41598-024-83562-6Metric dimension of star fan graphS. Prabhu0D. Sagaya Rani Jeba1Sudeep Stephen2Department of Mathematics, Rajalakshmi Engineering CollegeDepartment of Mathematics, Panimalar Engineering CollegeFaculty of Education and Arts, Australian Catholic UniversityAbstract Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set. Conditional resolving sets are obtained by imposing various constraints on resolving set. It is a fundamental parameter that provides insights into the structural properties and navigability of graphs, with diverse applications across different fields. This article focuses on identifying the metric dimension for a new network, star fan graph.https://doi.org/10.1038/s41598-024-83562-6Resolving setBasisStar fan graph |
| spellingShingle | S. Prabhu D. Sagaya Rani Jeba Sudeep Stephen Metric dimension of star fan graph Scientific Reports Resolving set Basis Star fan graph |
| title | Metric dimension of star fan graph |
| title_full | Metric dimension of star fan graph |
| title_fullStr | Metric dimension of star fan graph |
| title_full_unstemmed | Metric dimension of star fan graph |
| title_short | Metric dimension of star fan graph |
| title_sort | metric dimension of star fan graph |
| topic | Resolving set Basis Star fan graph |
| url | https://doi.org/10.1038/s41598-024-83562-6 |
| work_keys_str_mv | AT sprabhu metricdimensionofstarfangraph AT dsagayaranijeba metricdimensionofstarfangraph AT sudeepstephen metricdimensionofstarfangraph |