On the Strong Metric Dimension of Tetrahedral Diamond Lattice

Journal article

Manuel, Paul, Rajan, Bharati, Grigorious, Cyriac and Stephen, Sudeep. (2015). On the Strong Metric Dimension of Tetrahedral Diamond Lattice. Mathematics in Computer Science. 9(2), pp. 201-208. https://doi.org/10.1007/s11786-015-0226-0
AuthorsManuel, Paul, Rajan, Bharati, Grigorious, Cyriac and Stephen, Sudeep
Abstract

A resolving set is a set W of vertices of a connected graph G(V, E) such that for every pair of vertices u, v of G, there exists a vertex w ∈ W with the condition that the length of a shortest path from u to w is different from the length of a shortest path from v to w. A resolving set of minimum cardinality of G is called a metric basis. Metric dimension is the cardinality of a metric basis. A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exists at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W ⊆ V, is said to be a strong resolving set if for all pairs u, v /∈ W, there exists some element s ∈ W such that s strongly resolves the pair u, v. A strong resolving set of minimum cardinality is called a strong metric basis. The cardinality of a strong metric basis for G is called the strong metric dimension of G. The strong metric dimension (metric dimension) problem is to find a strong metric basis (metric basis) in the graph. In this paper, we solve the strong metric dimension and the metric dimension problems for the graph of tetrahedral diamond lattice.

KeywordsMetric basis; Strong metric basis; Metric dimension; Strong metric dimension; Tetrahedral diamond lattice
Year01 Jan 2015
JournalMathematics in Computer Science
Journal citation9 (2), pp. 201-208
PublisherSpringer Basel AG
ISSN1661-8270
Digital Object Identifier (DOI)https://doi.org/10.1007/s11786-015-0226-0
Web address (URL)https://link.springer.com/article/10.1007/s11786-015-0226-0
Research or scholarlyResearch
Page range201-208
Publisher's version
License
All rights reserved
File Access Level
Controlled
Output statusPublished
Publication dates
Online07 May 2015
Publication process dates
Accepted23 Mar 2015
Deposited21 May 2024
Additional information

© Springer Basel 2015

Place of publicationSwitzerland
Permalink -

https://acuresearchbank.acu.edu.au/item/907v0/on-the-strong-metric-dimension-of-tetrahedral-diamond-lattice

Log in to edit

Restricted files

Publisher's version

  • 12
    total views
  • 0
    total downloads
  • 1
    views this month
  • 0
    downloads this month
These values are for the period from 19th October 2020, when this repository was created.

Export as

Related outputs

Embedding Wheel-like Networks
Rajan, R. Sundara, Rajalaxmi, Rajalaksmi, Stephen, Sudeep, Shantrinal, A. Arul and Kumar, K. Jagadeesh. (2023). Embedding Wheel-like Networks. Iranian Academic Center for Education, Culture and Research. 18(2), pp. 185-198. https://doi.org/10.61186/ijmsi.18.2.185
Zero forcing in iterated line digraphs
Ferrero, Daniela, Kalinowski, Thomas and Stephen, Sudeep. (2019). Zero forcing in iterated line digraphs. Discrete Applied Mathematics. 255, pp. 198-208. https://doi.org/10.1016/j.dam.2018.08.019
Minimum rank and zero forcing number for butterfly networks
Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe and Stephen, Sudeep. (2019). Minimum rank and zero forcing number for butterfly networks. Journal of Combinatorial Optimization. 37(3), pp. 970-988. https://doi.org/10.1007/s10878-018-0335-1
A lower bound on the zero forcing number
Davila, Randy, Kalinowski, Thomas and Stephen, Sudeep. (2018). A lower bound on the zero forcing number. Discrete Applied Mathematics. 250, pp. 363-367. https://doi.org/10.1016/j.dam.2018.04.015
Average distance in interconnection networks via reduction theorems for vertex-weighted graphs
Klavžar, Sandi, Manuel, Paul, Nadjafi-Arani, M. J., Rajan, R. Sundara, Grigorious, Cyriac and Stephen, Sudeep. (2016). Average distance in interconnection networks via reduction theorems for vertex-weighted graphs. The Computer Journal. 59(12), pp. 1900-1910. https://doi.org/10.1093/comjnl/bxw046
Resolving-power dominating sets
Stephen, Sudeep, Rajan, Bharati, Grigorious, Cyriac and William, Albert. (2015). Resolving-power dominating sets. Applied Mathematics and Computation. 256, pp. 778-785. https://doi.org/10.1016/j.amc.2015.01.037
Power domination in certain chemical structures
Stephen, Sudeep, Rajan, Bharati, Ryan, Joe, Grigorious, Cyriac and William, Albert. (2015). Power domination in certain chemical structures. Journal of Discrete Algorithms (Amsterdam). 33, pp. 10-18. https://doi.org/10.1016/j.jda.2014.12.003
On the metric dimension of circulant and Harary graphs
Grigorious, Cyriac, Manuel, Paul, Miller, Mirka, Rajan, Bharati and Stephen, Sudeep. (2014). On the metric dimension of circulant and Harary graphs. Applied Mathematics and Computation. 248, pp. 47-54. https://doi.org/10.1016/j.amc.2014.09.045
On the partition dimension of a class of circulant graphs
Grigorious, Cyriac, Stephen, Sudeep, Rajan, Bharati, Miller, Mirka and William, Albert. (2014). On the partition dimension of a class of circulant graphs. Information Processing Letters. 114(7), pp. 353-356. https://doi.org/10.1016/j.ipl.2014.02.005