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
- Article type
- Year
Open Access
Research Article
Issue
Open Access
Research Article
Issue
Give us a linked graph,
Open Access
Research Article
Issue
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
Open Access
Research Article
Issue
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
Open Access
Research Article
Issue
The interval-valued (
京公网安备11010802044758号