On Metric Dimension of Biswapped Networks
| dc.contributor.author | Waqar Ali | |
| dc.contributor.author | CIIT/FA19-RMT-099/LHR | |
| dc.contributor.author | Dr. Muhammad Faisal Nadeem | |
| dc.contributor.author | LHR TP 7384 | |
| dc.date.accessioned | 2026-04-20T08:41:29Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | The biswapped networks is a new interconnection networks in multiprocessor systems. These are networks of devices or processor and connection of these devices or processors. Here network can be expressed in the form of graph. Devices or processors represent vertices (nodes) and connection of devices or processors represent edges (links). The subset of the nodes set is called the resolving set if all the representations are different. The minimum cardinality of resolving set is called the locating number or metric dimension. In this article we found the locating number of different types of interconnection networks. We found the exact value of locating number for biswapped networks developed by different basic graphs like, path, cycle, and power graph of path graph. | |
| dc.identifier.uri | https://repository.cuilahore.edu.pk/123456789/3620 | |
| dc.language.iso | en | |
| dc.publisher | Library Information Services, COMSATS University Islamabad, Lahore Campus | |
| dc.relation.ispartofseries | LHR TP 7384 | |
| dc.subject | Department of Mathematics | |
| dc.subject | FA19 | |
| dc.subject | Mathematics | |
| dc.subject | interconnection networks | |
| dc.subject | basic graphs | |
| dc.subject | path graph | |
| dc.subject | Dr. Muhammad Faisal Nadeem | |
| dc.title | On Metric Dimension of Biswapped Networks | |
| dc.type | Thesis |