Resolvability in Subdivision of Circulant Networks Cn1,k
Circulant networks form a very important and widely explored class of graphs due to their interesting and wide-range applications in networking, facility location problems, and their symmetric properties. A resolving set is a subset of vertices of a connected graph such that each vertex of the graph...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2020-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2020/4197678 |