Publications
Sort:
Open Access Research Article Issue
Metric dimension of line graphs of optimal fault-tolerant token ring networks
AIMS Mathematics 2026, 11(3): 7264-7284
Published: 15 March 2026
Abstract PDF (281.5 KB) Collect
Downloads:14

Interconnection networks are commonly modeled as graphs, where vertices represent processors or devices and edges represent communication links. In such networks, locating or identifying components using a small set of reference points is fundamental for routing, fault diagnosis, monitoring, and navigation. A standard graph-theoretic measure of this capability is the metric dimension (or locating number), defined as the minimum cardinality of a resolving set whose distance vectors uniquely distinguish all vertices. Since determining the metric dimension is NP-hard in general, exact values for structured network families are of both theoretical and practical interest. In this paper, we studied the metric dimension of the line graph of an optimal 2-fault-tolerant token ring network. The underlying network T m 2 augments a simple ring with additional links to ensure robust connectivity under up to two link or node failures, while the line graph L ( T m 2 ) represents the network at the link level. A lemma was established to prove the lower bound of the metric dimension via contradiction, while the upper bound was determined by explicitly constructing resolving sets. The analysis was conducted case by case according to the congruence of the network order modulo 4, which simplified verification of all representation vectors. Our results showed that the fault-tolerant links increase the metric dimension compared with ordinary token rings, highlighting the influence of additional links on network distinguishability and providing insights for the design of robust interconnection networks.

Open Access Research Article Issue
Resolving set and exchange property in nanotube
AIMS Mathematics 2023, 8(9): 20305-20323
Published: 15 September 2023
Abstract PDF (279.9 KB) Collect
Downloads:8

Give us a linked graph, G = ( V , E ) . A vertex w ∈ V distinguishes between two components (vertices and edges) x , y ∈ E ∪ V if d G ( w , x ) ≠ d G ( w , y ) . Let W 1 and W 2 be two resolving sets and W 1 ≠ W 2 . Then, we can say that the graph G has double resolving set. A nanotube derived from an quadrilateral-octagonal grid belongs to essential and extensively studied compounds in materials science. Nano-structures are very important due to their thickness. In this article, we have discussed the metric dimension of the graphs of nanotubes derived from the quadrilateral-octagonal grid. We proved that the generalized nanotube derived from quadrilateral-octagonal grid have three metric dimension. We also check that the exchange property is also held for this structure.

Open Access Research Article Issue
Generalized perimantanes diamondoid structure and their edge-based metric dimensions
AIMS Mathematics 2022, 7(7): 11718-11731
Published: 15 July 2022
Abstract PDF (372 KB) Collect
Downloads:5

Due to its superlative physical qualities and its beauty, the diamond is a renowned structure. While the green-colored perimantanes diamondoid is one of a higher diamond structure. Motivated by the structure's applications and usage, we look into the edge-based metric parameters of this structure. In this draft, we have discussed edge metric dimension and their generalizations for the generalized perimantanes diamondoid structure and proved that each parameter depends on the copies of original or base perimantanes diamondoid structure and changes with the parameter λ or its number of copies.

Open Access Research Article Issue
Computing vertex resolvability of benzenoid tripod structure
AIMS Mathematics 2022, 7(4): 6971-6983
Published: 15 April 2022
Abstract PDF (360.5 KB) Collect
Downloads:5

In this paper, we determine the exact metric and fault-tolerant metric dimension of the benzenoid tripod structure. We also computed the generalized version of this parameter and proved that all the parameters are constant. Resolving set L is an ordered subset of nodes of a graph C , in which each vertex of C is distinctively determined by its distance vector to the nodes in L . The cardinality of a minimum resolving set is called the metric dimension of C . A resolving set L f of C is fault-tolerant if L f ∖ b is also a resolving set, for every b in L f . Resolving set allows to obtain a unique representation for chemical structures. In particular, they were used in pharmaceutical research for discovering patterns common to a variety of drugs. The above definitions are based on the hypothesis of chemical graph theory and it is a customary depiction of chemical compounds in form of graph structures, where the node and edge represents the atom and bond types, respectively.

Open Access Research Article Issue
Randić energies in decision making for human trafficking by interval-valued T-spherical fuzzy Hamacher graphs
AIMS Mathematics 2025, 10(4): 9697-9747
Published: 15 April 2025
Abstract PDF (425.4 KB) Collect
Downloads:6

The interval-valued ( I V) T-spherical fuzzy set ( I V T S F S ) appears to be more effective and practical in dealing with uncertainty and ambiguity while dealing with various decision-making ( D M) problems than other fuzzy sets, for example, the q-rung ortho-pair fuzzy set, T-spherical fuzzy set, and picture fuzzy set. In real-life problems, where intuitionistic fuzzy sets, interval-valued intuitionistic fuzzy sets, or interval-valued picture fuzzy sets give unsatisfactory results, the I V T S F S is a mathematical model that is used to deal with such problems where these method fails, and one can handle it efficiently by using I V T S F S . If there is a different framework that has a base of four opinions — yes, no, abstains, and refusal — the I V T S F S looks to be the most beneficial, and it is also proven to be so. In this article, an idea of interval-valued T-spherical fuzzy Hamacher graphs ( I V T S F H G s ) is proposed, which is based on the Hamacher t-norm ( T N) and Hamacher t-conorm ( T C N). It provides enhanced discrimination and flexibility in uncertain environments by capturing a broader spectrum of hesitancy and indeterminacy, which other fuzzy models like interval-valued intuitionistic fuzzy set ( I V I F S) or picture fuzzy set ( P F S) may overlook. This article aims to examine the energy associated with the splitting of I V T S F H G s , as well as the energy related to shadow I V T S F H G s . Moreover, the Randić energy of I V T S F H G s was presented, and an in-depth analysis of its essential outcomes was conducted. Additionally, this study introduces interval-valued T-spherical fuzzy Hamacher digraphs ( I V T S F H D G s ) and explores their diverse outcomes. An algorithm involving I V T S F H D G s was also studied, which is used to propose energies of I V T S F H G s in D M, problems, and Hamacher aggregation operators. To validate the proposed results, a comparative study is conducted.

Total 5