7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
View/Download PDF

Translate this page into:

Original article
08 2022
:34;
102208
doi:
10.1016/j.jksus.2022.102208

Computation of vertex and edge resolvability of benzenoid tripod structure

Department of Mathematics, College of Science, Jazan University, New Campus, Jazan 2097, Saudi Arabia
College of Computer Science & Information Technology, Jazan University, Jazan, Saudi Arabia
Department of Mathematics, Riphah Institute of Computing and Applied Sciences, Riphah International University, Lahore, Pakistan

⁎Corresponding author.

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Peer review under responsibility of King Saud University.

Abstract

In the chemistry, the chemical compound’s structures are commonly shown by the graphs. In the scenario, atoms are replaced with vertices or nodes and bond types with simple lines known as edges. When the each node and edge of a graph have distinct representation or location with respect to the chosen vertices in a subset from the graph is known as the resolving set of mixed metric dimension say F m . This concept is known as vertex and edge resolvability parameter. This concept is usually helps to acquired a unique location or position of a structure or a graph. It is used to know the patterns of different drugs in the pharmaceutical research. There are many other applications of this variant. The exact metric dimension or resolving set of mixed metric dimension of benzenoid tripod structure is found in this research work. We proved that, this parameter is constant for the particular structure of benzenoid tripod graph.

Keywords

05C12
05C90
05C05
Node-resolvability
Edge-resolvability
Benzenoid structure
Benzenoid tripod
PubMed
1

1 Introduction

Understanding the chemical structures that support current chemical ideas, establishing and exploring unique mathematical models of chemical processes, and applying mathematical concepts and techniques to chemistry are just a few of the challenges that mathematical chemistry has lately addressed. Throughout the history of science, some countable researchers have been persuaded to utilize links between both major fields in which mathematics and the second most important is chemistry, as well as the prospect of using basic operations of arithmetic to deduce established and anticipate new chemical properties. Mathematical techniques are frequently employed in a variety of fields of physical chemistry, most notably thermodynamics and chemical energy. After physicists demonstrated in the early 20 th century that the main properties of chemical compounds could be foresee using the techniques of quantum theory, there was a considerable demand for math in chemistry. The realization that chemistry cannot be understood without understanding of quantum physics, including its sophisticated mathematical tools, was the fundamental driving factor that brought the math and its concepts into the laboratories of chemistry. We recommend various material for distinct studies of related to the topic of mathematical chemistry in th form of graph theory (Yang et al., 2019; Manzoor et al., 2020; Siddiqui et al., 2016).

To characterize the structural properties of clusters, polymers, crystals, processes, molecules and many other materials, chemical graph theory is used which is very deep and novel field of mathematical science. The nodes or vertices of this field can be orbitals, intermediates, group of atoms, molecule, electron and many other items. Some forces such as Debye, Keesom, van der Waals forces may all be used to show the relationships between a structure’s vertices, moreover, also some non-bonded and bonded connection, intermolecular bonding and basic reactions.

For the literature review and base case parameter of this case study, we will start from Nadeem et al. (2020), in which authors made a three-dimensional hexagonal structure and proved that the resolving set of this is constant, moreover this concept is named as locating number and discussed some applications. Particular type of chemical structure are also studied by this parameter, for example α -boron nanotubes are discussed in Hussain et al. (2018), silicate star structure and its metric are determined in Simonraj and George (2015), on the cellulose network (Siddiqui and Imran, 2015). And another structure of VC 5 C 7 nanotubes are reshaped with this parameter are available in Imran et al. (2019). Mixed metric generators for generalized Peterson graphs and some generalize classes of rotational symmetric graphs are studied in Raza and Ji (2020) and Raza et al. (2020). The graph generated from different path graphs and discussed its edge and vertex resolvability in Raza et al. (2020). The vertex and edge resolvability of polcyclic hydrocarbons from aromatic family are found in Azeem and Nadeem (2021).

The seminal paper of the notion of resolving sets, are available at Slater (1975), the same idea presented by Harary and Melter (1976) with the name of locating parameter. In the pure graph theoretical parameter (Chartrand et al., 2000; Chartrand et al., 2000) named it as metric generator. This parameter have distinct applications and implementations like, for determining the patterns of variant of drugs in the field of pharmaceutical research, the statement enclosed by Johnson (1993). Metric resolving parameters have different variant of applications, such as image processing, facility location problems, sonar and coastguard loran (Slater, 1975), combinatorial optimization (Sebö and Tannier, 2004), computer networks (Manuel et al., 2008), weighing problems (Söderberg and Shapiro, 1963), robot navigation (Khuller et al., 1996), for detailed and further study on this parameter see (Perc et al., 2013; Perc and Szolnoki, 2010). The notion of metric dimension is commonly employed to address many complex issues due to its vast range of applications. We refer to for resolvability parameters of various chemical structures (Hussain et al., 2018; Krishnan and Rajan, 2016; Siddiqui and Imran, 2014).

Two edges are separated in the similar manner of vertices. For example, instead of nodes of a graph two edges may have unique representation or locations in terms of with respect to the chosen vertices in a subset of a graph. Taking this reason behind (Kelenc et al., 2018) put forward another parameter known as the edge metric resolving set or the edge metric dimension. In which the used the metric of a graph in terms of edges to locate every pair of edges and it is purely depend on the selection of vertices. Later on Kelenc et al. (Dec 2017), developed a mixed metric dimension in which both notions (recognising vertices and edges) are combined, with the additional restriction that no two elements (vertices and edges) have the same distances with regard to the selected subset. For the computational costs of all above topics we suggested to see (Hauptmann et al., 2012; Lewis et al., 1983; Johnson, 1993; Johnson, 1998).

Next to this, some basic definitions are provided for the basic use of them in our main task. In the Section 2, construction of our main structure or chemical compound is drawn for the better understanding to readers. Also the same section included the results of main task in terms of lemmas and remarks. In the Section 3, conclusion is drawn and closing remarks are added. At the end appropriate references are given related to this research work.

Given below are basic concepts and background results related to study of this work.

Definition 1.1

Definition 1.1 Nadeem et al. (2020)

“Assume C be an associated graph of chemical structure/network, whose vertex/node set we will denote with symbol N ( C ) or simply N , while B ( C ) or B is the edge/bond set, the shortest distance between two bonds b 1 , b 2 N ( C ) denoted by S b 1 , b 2 , and calculated by counting the number of bonds while moving through the b 1 - b 2 path. The distance between an edge e = b 1 b 2 B ( C ) , and a node b N ( C ) is counted by the relation S e , b = min { S b 1 , b , S b 2 , b } .”

Definition 1.2

Definition 1.2 Deng et al. (mar 2021)

“A vertex b of a connected associated graph C of a chemical structure, differentiates nodes ( b 1 ) and edges ( e 1 ), if S b 1 , b S b , e 1 . A subset F m is a mixed resolving set if any different pair of components of C are separated by a node of F m . The minimum number of nodes in mixed resolving set for C is named the mixed metric dimension and is denoted by dim m ( C ) . It is also known as blended version of both metric (Slater, 1975) and edge metric dimension (Chartrand et al., 2000).”

Theorem 1.3

Theorem 1.3 Kelenc et al. (Dec 2017)

“If dim m ( C ) is the mixed metric dimension, then dim m ( C ) = 2 , iff C is a path P n .”

2

2 Construction of tripod structure

Benzenoid hydrocarbons are considered as very important and natural representations of graph of benzenoid systems, because of their prominence in theoretical chemistry (Chou et al., 2012). According to Ali et al. (2018), it is an established theory that benzenoids based hydrocarbons are vital and advantageous in the environmental, food and chemical sectors. Various catacondensed and pericondensed benzenoid structures were considered in respect to polynomial types. This is a tripod made of pericondensed benzenoid. It has 4 θ 1 + θ 2 + θ 3 - 8 nodes and 5 θ 1 + θ 2 + θ 3 - 11 bonds, with all the running parameters θ 1 , θ 2 , θ 3 2 . In addition, Jamil et al. (2020) is available for comprehensive topological studies of benzenoid structures and in Koam et al. (2021), some metric based study is recently came up in the literature. The bond and node or we can say simply edge set and vertex set for this benzenoid structure T θ 1 , θ 2 , θ 3 is shown below. We use the labelling of edges and nodes provided in Fig. 1 in our primary results (Ali et al., 2021). N T θ 1 , θ 2 , θ 3 = { a δ : 1 δ 2 θ 3 } { b δ : 1 δ 2 θ 1 } { c δ , c δ : 1 δ 2 θ 2 - 1 } { a δ : 1 δ 2 θ 3 - 3 } { b δ : 1 δ 2 θ 1 - 3 } , B T θ 1 , θ 2 , θ 3 = { a δ a δ + 1 : 1 δ 2 θ 3 - 1 } { b δ b δ + 1 : 1 δ 2 θ 1 - 1 } { c δ c δ + 1 , c δ c δ + 1 : 1 δ 2 θ 2 - 2 } { a δ a δ + 1 : 1 δ 2 θ 3 - 4 } { b δ b δ + 1 : 1 δ 2 θ 1 - 4 } { a δ a δ : 1 δ odd 2 θ 3 - 3 } { b δ + 3 b δ : 1 δ odd 2 θ 1 - 3 } { c δ c δ : 1 δ odd 2 θ 2 - 1 } { a 2 θ 3 b 1 , a 2 θ 3 - 1 c 1 , b 2 c 1 , a 2 θ 3 - 3 c 2 , b 1 c 2 , } .

Lemma 2.1

If T θ 1 , θ 2 , θ 3 is a benzenoid tripod graph with any of θ 1 , θ 2 , θ 3 = 2 , then the mixed metric resolving set has minimum three members.

Proof

The order or the total amount of vertices in the benzenoid tripod’s associated graph with any of θ 1 , θ 2 , θ 3 = 2 , are 4 θ 1 + θ 2 + θ 3 - 8 , and to look over the likelihood of mixed metric resolving set having three members in it, are C 4 θ 1 + θ 2 + θ 3 - 8 , 3 = 4 θ 1 + θ 2 + θ 3 - 8 ! 2 × 4 θ 1 + θ 2 + θ 3 - 11 ! . Over here we are focusing on three members in the set, from the result of Theorem 1.3 in the literature, the only two member of mixed metric resolving set is just for the basic graph f path. Now because of its computational cost of selecting mixed metric resolving set, for a graph, we can’t discover the precise number of mixed resolving sets, but from 4 θ 1 + θ 2 + θ 3 - 8 ! 2 × 4 θ 1 + θ 2 + θ 3 - 11 ! -possibilities we selected a subset F m and described as: F m = { a 1 , a 2 θ 3 , b 2 θ 1 } . Proving of this claim that F m is also a subset having ability to be the candidate of mixed metric resolvability set of benzenoid tripod graph or T θ 1 , θ 2 , θ 3 , we will stick to 1.2’s definition. We will also look over the distinct placements or locations of each node and edge to meet the definition’s requirements, and the approach is explained above in Definition 1.2.

Positions p a δ | F m with respect to F m , for the nodes a δ with δ = 1 , 2 , , 2 θ 3 , are described as: p a δ | F m = δ - 1 , 2 θ 3 - δ , 2 θ 3 + θ 1 - δ .

Positions p b δ | F m with respect to F m , for the nodes b δ with δ = 1 , 2 , , 2 θ 1 , are described as: p b δ | F m = 2 θ 3 + δ - 1 , δ , 2 θ 1 - δ .

Positions p c δ | F m with respect to F m , for the nodes c δ with δ = 1 , 2 , , 2 θ 2 - 1 , are described as: p c δ | F m = 2 θ 3 + δ - 1 , δ + 2 , 2 θ 1 - 1 , if δ = 1 ; 2 θ 3 + δ - 1 , δ + 2 , 2 θ 1 - 2 + δ , if δ = 2 ; 2 θ 3 + δ - 3 , δ + 2 , 2 θ 1 - 2 + δ , if δ = 3 , 4 , , 2 θ 2 - 1 .

Positions p a δ | F m with respect to F m , for the nodes a δ with δ = 1 , 2 , , 2 θ 3 - 3 , are described as: p a δ | F m = δ , 2 θ 3 + 1 - δ , 2 θ 3 + θ 1 - 1 - δ .

Positions p b δ | F m with respect to F m , for the nodes b δ with δ = 1 , 2 , , 2 θ 1 - 3 , are described as: p b δ | F m = 2 θ 3 + δ + 1 , δ + 4 , 2 θ 1 - 1 - δ .

Positions p c δ | F m with respect to F m , for the nodes c δ with δ = 1 , 2 , , 2 θ 2 - 1 , are described as: p c δ | F m = 2 θ 3 - 1 , δ + 1 , 2 θ 1 - 1 + δ , if δ = 1 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 1 + δ , if δ = 2 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 3 + δ , if δ = 3 , 4 , , 2 θ 2 - 1 .

Given above are the positions of nodes only, with respect to the chosen vertices in F m , for the fulfillment of definition of mixed resolving set we still need to investigates the edges or bonds of graph. Following are positions of bonds that will complete the definition.

Positions p a δ a δ + 1 | F m with regard to F m , for the bonds a δ a δ + 1 with δ = 1 , 2 , , 2 θ 3 - 1 , are described as: p a δ a δ + 1 | F m = δ - 1 , 2 θ 3 - 1 - δ , 2 θ 3 + θ 1 - 1 - δ , if δ = 1 , 2 , , 2 θ 3 - 2 ; δ - 1 , 2 θ 3 - 1 - δ , 2 θ 3 , if δ = 2 θ 3 - 1 .

Positions p b δ b δ + 1 | F m with regard to F m , for the bonds b δ b δ + 1 with δ = 1 , 2 , , 2 θ 1 - 1 , are described as: p b δ b δ + 1 | F m = 2 θ 3 + δ - 1 , δ , 2 θ 1 - 1 - δ .

Positions p c δ c δ + 1 | F m with regard to F m , for the bonds c δ c δ + 1 with δ = 1 , 2 , , 2 θ 2 - 2 , are described as: p c δ c δ + 1 | F m = 2 θ 3 , δ + 2 , 2 θ 1 - 2 , if δ = 1 ; 2 θ 3 , δ + 2 , 2 θ 1 - 2 + δ , if δ = 2 ; 2 θ 3 + δ - 3 , δ + 2 , 2 θ 1 - 2 + δ , if δ = 3 , 4 , , 2 θ 2 - 1 .

Positions p a δ a δ + 1 | F m with regard to F m , for the bonds a δ a δ + 1 with δ = 1 , 2 , , 2 θ 3 - 4 , are described as: p a δ a δ + 1 | F m = δ , 2 θ 3 - δ , 2 θ 3 + θ 1 - 1 - δ .

Positions p b δ b δ + 1 | F m with regard to F m , for the bonds b δ b δ + 1 with δ = 1 , 2 , , 2 θ 1 - 4 , are described as: p b δ b δ + 1 | F m = 2 θ 3 + δ + 1 , δ + 4 , 2 θ 1 - 3 - δ .

Positions p c δ c δ + 1 | F m with regard to F m , for the bonds c δ c δ + 1 with δ = 1 , 2 , , 2 θ 2 - 2 , are described as: p c δ c δ + 1 | F m = 2 θ 3 - 1 , δ + 1 , 2 θ 1 , if δ = 1 ; 2 θ 3 - 1 , δ + 1 , 2 θ 1 , if δ = 2 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 3 + δ , if δ = 3 , 4 , , 2 θ 2 - 1 .

Positions p a δ a δ | F m with regard to F m , for the bonds a δ a δ with δ = 1 , 3 , , 2 θ 3 - 3 , are described as: p a δ a δ | F m = δ - 1 , 2 θ 3 - δ , 2 θ 3 + θ 1 - 1 - δ .

Positions p b δ + 3 b δ | F m with regard to F m , for the bonds b δ + 3 b δ with δ = 1 , 3 , , 2 θ 1 - 3 , are described as: p b δ + 3 b δ | F m = 2 θ 3 + δ + 1 , δ + 3 , 2 θ 1 - 3 - δ .

Positions p c δ a δ | F m with regard to F m , for the bonds c δ c δ with δ = 1 , 3 , , 2 θ 2 - 3 , are described as: p c δ c δ | F m = 2 θ 3 - 1 , δ + 1 , 2 θ 1 - 1 , if δ = 1 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 2 + δ , if δ = 2 , 3 , , 2 θ 2 - 1 .

Positions of the joint edges are described as: p a 2 θ 3 b 1 | F m = 2 θ 3 - 1 , 0 , 2 θ 1 - 1 , p a 2 θ 3 c 1 | F m = 2 θ 3 - 2 , 1 , 2 θ 1 , p b 2 c 1 | F m = 2 θ 3 , 2 , 2 θ 1 - 2 , p a 2 θ 3 - 3 c 2 | F m = 2 θ 3 - 3 , 3 , 2 θ 1 + 1 , p b 1 c 2 | F m = 2 θ 3 + 1 , 4 , 2 θ 1 - 3 .

By the given positions p . | F m of all 4 θ 1 + θ 2 + θ 3 - 8 -nodes and 5 θ 1 + θ 2 + θ 3 - 11 -edges of T θ 1 , θ 2 , θ 3 graph of benzenoid tripod with any of θ 1 , θ 2 , θ 3 = 2 , with respect to F m , are unique and no two nodes, no two edges and not a single edge with a vertex have same position p . As a result, we may infer that the nodes and edges of the T θ 1 , θ 2 , θ 3 graph have been resolved with only three nodes. So it is concluded that the members with minimality conditions of mixed metric resolving set of T θ 1 , θ 2 , θ 3 are three. □

Remark 1

If T θ 1 , θ 2 , θ 3 is a of benzenoid tripod graph with any of θ 1 , θ 2 , θ 3 = 2 , then dim m T θ 1 , θ 2 , θ 3 = 3 .

Proof

As based on the definition of mixed metric dimension, the concept is solemnly based on the selected subset ( F m ) chooses in a manner that each edge and vertex have distinct location in regards to the chosen vertices in subset. The Lemma 2.1 shows and proved the chosen subset for the mixed metric resolving set and their hardness to be chosen with the condition of minimality. We proved in that lemma the subset F m = { a 1 , a 2 θ 3 , b 2 θ 1 } is one of the candidate for the mixed metric resolving set for a particular benzenoid tripod or T θ 1 , θ 2 , θ 3 graph for all the possible combinatorial values of with any of θ 1 , θ 2 , θ 3 = 2 . Moreover, we discussed in the same lemma that F m = 3 is fulfilling the minimality conditions on their members. It is impossible to get a subset with two members in a selected subset. It is sufficient to verify what we assert in the assertion that the mixed metric dimension of the benzenoid tripod is three, which concludes the proof. □

Lemma 2.2

If T θ 1 , θ 2 , θ 3 is a benzenoid tripod graph with θ 1 , θ 2 , θ 3 3 , then the mixed metric resolving set has minimum four members.

Proof

The order or the total amount of vertices in the benzenoid tripod’s associated graph with any of θ 1 , θ 2 , θ 3 3 , are 4 θ 1 + θ 2 + θ 3 - 8 , and to look over the likelihood of mixed metric resolvability set having four members in it, are C 4 θ 1 + θ 2 + θ 3 - 8 , 4 = 4 θ 1 + θ 2 + θ 3 - 8 ! 2 × 4 θ 1 + θ 2 + θ 3 - 12 ! . Over here we are focusing on four members in the set, for the three cardinality of mixed resolving set we will discuss in next part of this proof. Now because of its computational cost of selecting mixed metric resolving set, for a graph, we can’t discover the precise number of mixed resolving sets, but from 4 θ 1 + θ 2 + θ 3 - 8 ! 2 × 4 θ 1 + θ 2 + θ 3 - 12 ! -possibilities we selected the subset F m and described as: F m = { a 1 , a 2 θ 3 , b 2 θ 1 , c 2 θ 2 - 1 } . Proving of this claim that F m is also a subset having ability to be the candidate of mixed metric resolving set of benzenoid tripod graph or T θ 1 , θ 2 , θ 3 , we will stick to 1.2’s definition. We will also look over the distinct placements or locations of each node and edge to meet the definition’s requirements, and the approach is explained above in Definition 1.2.

Positions p a δ | F m with respect to F m , for the nodes a δ with δ = 1 , 2 , , 2 θ 3 , are described as: p a δ | F m = δ - 1 , 2 θ 3 - δ , 2 θ 3 + θ 1 - δ , 2 θ 3 + θ 2 - 3 - δ , if δ = 1 , 2 , , 2 θ 3 - 3 ; δ - 1 , 2 θ 3 - δ , 2 θ 3 + θ 1 - δ , 2 θ 2 + 1 , if δ = 2 θ 3 - 2 ; δ - 1 , 2 θ 3 - δ , 2 θ 3 + θ 1 - δ , 2 θ 2 , if δ = 2 θ 3 - 1 ; δ - 1 , 2 θ 3 - δ , 2 θ 3 + θ 1 - δ , 2 θ 2 + 1 , if δ = 2 θ 3 .

Positions p b δ | F m with respect to F m , for the nodes b δ with δ = 1 , 2 , , 2 θ 1 , are described as: p b δ | F m = 2 θ 3 + δ - 1 , δ , 2 θ 1 - δ , 2 θ 2 + 1 - δ , if δ = 1 , 2 ; 2 θ 3 + δ - 1 , δ , 2 θ 1 - δ , 2 θ 2 , if δ = 3 ; 2 θ 3 + δ - 1 , δ , 2 θ 1 - δ , 2 θ 2 - 5 + δ , if δ = 4 , 5 , , 2 θ 1 .

Positions p c δ | F m with respect to F m , for the nodes c δ with δ = 1 , 2 , , 2 θ 2 - 1 , are described as: p c δ | F m = 2 θ 3 + δ - 1 , δ + 2 , 2 θ 1 - 1 , 2 θ 2 - δ - 1 , if δ = 1 ; 2 θ 3 + δ - 1 , δ + 2 , 2 θ 1 - 2 + δ , 2 θ 2 - δ - 1 , if δ = 2 ; 2 θ 3 + δ - 3 , δ + 2 , 2 θ 1 - 2 + δ , 2 θ 2 - δ - 1 , if δ = 3 , 4 , , 2 θ 2 - 1 .

Positions p a δ | F m with respect to F m , for the nodes a δ with δ = 1 , 2 , , 2 θ 3 - 3 , are described as: p a δ | F m = δ , 2 θ 3 + 1 - δ , 2 θ 3 + θ 1 - 1 - δ , 2 θ 3 + θ 1 - 2 - δ .

Positions p b δ | F m with respect to F m , for the nodes b δ with δ = 1 , 2 , , 2 θ 1 - 3 , are described as: p b δ | F m = 2 θ 3 + δ + 1 , δ + 4 , 2 θ 1 - 1 - δ , 2 θ 2 - 3 + δ .

Positions p c δ | F m with respect to F m , for the nodes c δ with δ = 1 , 2 , , 2 θ 2 - 1 , are described as: p c δ | F m = 2 θ 3 - 1 , δ + 1 , 2 θ 1 - 1 + δ , 2 θ 2 - δ , if δ = 1 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 1 + δ , 2 θ 2 - δ , if δ = 2 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 3 + δ , 2 θ 2 - δ , if δ = 3 , 4 , , 2 θ 2 - 1 .

Given above are the positions of nodes only, with respect to the chosen vertices in F m , for the fulfillment of definition of mixed resolving set we still need to investigates the edges or bonds of graph. Following are positions of bonds that will complete the definition.

Positions p a δ a δ + 1 | F m with respect to F m , for the bonds a δ a δ + 1 with δ = 1 , 2 , , 2 θ 3 - 1 , are described as: p a δ a δ + 1 | F m = δ - 1 , 2 θ 3 - 1 - δ , 2 θ 3 + θ 1 - 1 - δ , 2 θ 3 + θ 2 - 2 - δ , if δ = 1 , 2 , , 2 θ 3 - 4 ; δ - 1 , 2 θ 3 - 1 - δ , 2 θ 3 + θ 1 - 1 - δ , 2 θ 2 , if δ = 2 θ 3 - 3 , 2 θ 3 - 2 ; δ - 1 , 2 θ 3 - 1 - δ , 2 θ 3 , 2 θ 2 , if δ = 2 θ 3 - 1 .

Positions p b δ b δ + 1 | F m in regards to F m , for the bonds b δ b δ + 1 with δ = 1 , 2 , , 2 θ 1 - 1 , are described as: p b δ b δ + 1 | F m = 2 θ 3 + δ - 1 , δ , 2 θ 1 - 1 - δ , 2 θ 2 - 1 , if δ = 1 , 2 , 3 ; 2 θ 3 + δ - 1 , δ , 2 θ 1 - 1 - δ , 2 θ 2 - 5 + δ , if δ = 4 , 5 , , 2 θ 1 - 1 .

Positions p c δ c δ + 1 | F m in regards to F m , for the bonds c δ c δ + 1 with δ = 1 , 2 , , 2 θ 2 - 2 , are described as: p c δ c δ + 1 | F m = 2 θ 3 , δ + 2 , 2 θ 1 - 2 , 2 θ 2 - 2 - δ , if δ = 1 ; 2 θ 3 , δ + 2 , 2 θ 1 - 2 + δ , 2 θ 2 - 2 - δ , if δ = 2 ; 2 θ 3 + δ - 3 , δ + 2 , 2 θ 1 - 2 + δ , 2 θ 2 - 2 - δ , if δ = 3 , 4 , , 2 θ 2 - 1 .

Positions p a δ a δ + 1 | F m in regards to F m , for the bonds a δ a δ + 1 with δ = 1 , 2 , , 2 θ 3 - 4 , are described as: p a δ a δ + 1 | F m = δ , 2 θ 3 - δ , 2 θ 3 + θ 1 - 1 - δ , 2 θ 3 + θ 1 - 5 - δ .

Positions p b δ b δ + 1 | F m in regards to F m , for the bonds b δ b δ + 1 with δ = 1 , 2 , , 2 θ 1 - 4 , are described as: p b δ b δ + 1 | F m = 2 θ 3 + δ + 1 , δ + 4 , 2 θ 1 - 3 - δ , 2 θ 2 - 3 + δ .

Positions p c δ c δ + 1 | F m in regards to F m , for the bonds c δ c δ + 1 with δ = 1 , 2 , , 2 θ 2 - 2 , are described as: p c δ c δ + 1 | F m = 2 θ 3 - 1 , δ + 1 , 2 θ 1 , 2 θ 2 - 3 + δ , if δ = 1 ; 2 θ 3 - 1 , δ + 1 , 2 θ 1 , 2 θ 2 - 3 + δ , if δ = 2 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 3 + δ , 2 θ 2 - 3 + δ , if δ = 3 , 4 , , 2 θ 2 - 1 .

Positions p a δ a δ | F m in regards to F m , for the bonds a δ a δ with δ = 1 , 3 , , 2 θ 3 - 3 , are described as: p a δ a δ | F m = δ - 1 , 2 θ 3 - δ , 2 θ 3 + θ 1 - 1 - δ , 2 θ 3 + θ 2 - 2 - δ .

Positions p b δ + 3 b δ | F m in regards to F m , for the bonds b δ + 3 b δ with δ = 1 , 3 , , 2 θ 1 - 3 , are described as: p b δ + 3 b δ | F m = 2 θ 3 + δ + 1 , δ + 3 , 2 θ 1 - 3 - δ , 2 θ 2 - 3 + δ .

Positions p c δ a δ | F m in regards to F m , for the bonds c δ c δ with δ = 1 , 3 , , 2 θ 2 - 3 , are described as: p c δ c δ | F m = 2 θ 3 - 1 , δ + 1 , 2 θ 1 - 1 , 2 θ 2 - 1 - δ , if δ = 1 ; 2 θ 3 - 2 + δ , δ + 1 , 2 θ 1 - 2 + δ , 2 θ 2 - 1 - δ , if δ = 2 , 3 , , 2 θ 2 - 1 .

Positions of the joint bonds are described as: p a 2 θ 3 b 1 | F m = 2 θ 3 - 1 , 0 , 2 θ 1 - 1 , 2 θ 2 , p a 2 θ 3 c 1 | F m = 2 θ 3 - 2 , 1 , 2 θ 1 , 2 θ 2 - 1 , p b 2 c 1 | F m = 2 θ 3 , 2 , 2 θ 1 - 2 , 2 θ 2 - 2 , p a 2 θ 3 - 3 c 2 | F m = 2 θ 3 - 3 , 3 , 2 θ 1 + 1 , 2 θ 2 - 2 , p b 1 c 2 | F m = 2 θ 3 + 1 , 4 , 2 θ 1 - 3 , 2 θ 2 - 3 .

In support of a particular fact in order to meet the definition’s requirements of mixed metric resolving set, we can say that F m having four members in it is achievable, however when we discuss the optimized value of F m , we still have to look at the least number for F m . The given bellow are some scenarios to consider while determining whether F m = 3 is achievable or not. Though we have found the set of mixed metric resolvability by doing with the help of algorithm and satisfied that F m 3 , but for the proving purpose we build some general cases and try to conclude that only F m > 3 is possible.

Case1: Assume that F m { a δ : δ = 1 , 2 , , 2 θ 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s | F m , where 1 r 2 θ 3 - 1 and 1 s odd 2 θ 3 - 3 . In the vertex’s position the similarities are in p a u | F m = p c v | F m , where 1 u 2 θ 3 and 1 v 2 θ 2 - 1 .

Case2: Assume that F m { b δ : δ = 1 , 2 , , 2 θ 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s + 1 | F m , where 1 r 2 θ 3 - 1 and 1 s 2 θ 3 - 4 . In the vertex’s position the similarities are in p a u | F m = p a v | F m , where 1 u 2 θ 3 and 1 v 2 θ 3 - 3 .

Case3: Assume that F m { c δ : δ = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r + 3 b r | F m = p a s a s + 1 | F m , where 1 r odd 2 θ 1 - 3 and 1 s 2 θ 3 - 1 . In the vertex’s position the similarities are in p a u | F m = p b v | F m , where 1 u 2 θ 3 and 1 v 2 θ 1 .

Case4: Assume that F m { a δ : δ = 1 , 2 , , 2 θ 3 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p c s c s | F m , where 1 r 2 θ 3 - 1 and 1 s odd 2 θ 2 - 1 . In the vertex’s position the similarities are in p a u | F m = p c v | F m , where 1 u 2 θ 3 and 1 v 2 θ 2 - 1 .

Case5: Assume that F m { b δ : δ = 1 , 2 , , 2 θ 1 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s + 1 | F m , where 1 r 2 θ 3 - 1 and 1 s 2 θ 3 - 4 . In the vertex’s position the similarities are in p a u | F m = p c v | F m , where 1 u 2 θ 3 and 1 v 2 θ 2 - 1 .

Case6: Assume that F m { c δ : δ = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s + 1 | F m , where 1 r , s 2 θ 3 - 1 . In the vertex’s position the similarities are in p a u | F m = p b v | F m , where 1 u 2 θ 3 and 1 v 2 θ 1 .

Case7: Assume that F m { a δ , b j : δ = 1 , 2 , , 2 θ 3 , j = 1 , 2 , , 2 θ 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r b r + 1 | F m = p b s b s + 1 | F m , where 1 r 2 θ 1 - 1 and 1 s 2 θ 1 - 4 . In the vertex’s position the similarities are in p a u | F m = p c v | F m , where 1 u 2 θ 3 and 1 v 2 θ 2 - 1 .

Case8: Assume that F m { a δ , c j : δ = 1 , 2 , , 2 θ 3 , j = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r + 3 b r | F m = p b s b s + 1 | F m , where 1 r odd 2 θ 1 - 3 and 1 s 2 θ 1 - 4 . In the vertex’s position the similarities are in p a u | F m = p c v | F m , where 1 u 2 θ 3 and 1 v 2 θ 2 - 1 .

Case9: Assume that F m { a δ , a j : δ = 1 , 2 , , 2 θ 3 , j = 1 , 2 , , 2 θ 3 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r b r + 1 | F m = p b s + 3 | b r F m , where 1 r 2 θ 1 - 1 and 1 s odd 2 θ 1 - 3 . In the vertex’s position the similarities are in p b u | F m = p b v | F m , where 1 u 2 θ 1 - 1 and 1 v 2 θ 1 - 3 .

Case10: Assume that F m { a δ , b j : δ = 1 , 2 , , 2 θ 3 , j = 1 , 2 , , 2 θ 1 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s | F m , where 1 r 2 θ 3 - 1 and 1 s odd 2 θ 3 - 3 . In the vertex’s position the similarities are in p a u | F m = p a v | F m , where 1 u 2 θ 3 and 1 v 2 θ 3 - 3 .

Case11: Assume that F m { a δ , c j : δ = 1 , 2 , , 2 θ 3 , j = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r b r + 1 | F m = p b s b s + 1 | F m , where 1 r 2 θ 1 - 1 and 1 s 2 θ 1 - 4 . In the vertex’s position the similarities are in p b u | F m = p b v | F m , where 1 u 2 θ 1 and 1 v 2 θ 1 - 3 .

Case12: Assume that F m { b δ , c j : δ = 1 , 2 , , 2 θ 1 , j = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s | F m , where 1 r 2 θ 3 - 1 and 1 s odd 2 θ 3 - 3 . In the vertex’s position the similarities are in p a u | F m = p b v | F m , where 1 u 2 θ 3 - 3 and 1 v 2 θ 1 - 3 .

Case13: Assume that F m { b δ , a j : δ = 1 , 2 , , 2 θ 1 , j = 1 , 2 , , 2 θ 3 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s | F m , where 1 r 2 θ 3 - 1 and 1 s odd 2 θ 3 - 3 . In the vertex’s position the similarities are in p a u | F m = p c v | F m , where 1 u 2 θ 3 - 3 and 1 v 2 θ 2 - 1 .

Case14: Assume that F m { b δ , b j : δ = 1 , 2 , , 2 θ 1 , j = 1 , 2 , , 2 θ 3 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s | F m , where 1 r 2 θ 3 - 1 and 1 s odd 2 θ 3 - 3 . In the vertex’s position the similarities are in p b u | F m = p b v | F m , where 1 u 2 θ 1 and 1 v 2 θ 1 - 3 .

Case15: Assume that F m { b δ , c j : δ = 1 , 2 , , 2 θ 1 , j = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s + 1 | F m , where 1 r 2 θ 3 - 1 and 1 s 2 θ 3 - 4 . In the vertex’s position the similarities are in p c u | F m = p c v | F m , where 1 u , v 2 θ 2 - 1 .

Case16: Assume that F m { c δ , a j : δ = 1 , 2 , , 2 θ 2 - 1 , j = 1 , 2 , , 2 θ 3 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r b r + 1 | F m = p b s b s + 1 | F m , where 1 r 2 θ 1 - 1 and 1 s 2 θ 1 - 4 . In the vertex’s position the similarities are in p b u | F m = p b v | F m , where 1 u , v 2 θ 1 .

Case17: Assume that F m { c δ , b j : δ = 1 , 2 , , 2 θ 2 - 1 , j = 1 , 2 , , 2 θ 1 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s + 1 | F m , where 1 r 2 θ 3 - 1 and 1 s 2 θ 3 - 4 . In the vertex’s position the similarities are in p a u | F m = p a v | F m , where 1 u 2 θ 3 and 1 v 2 θ 3 - 3 .

Case18: Assume that F m { c δ , c j : δ , j = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r b r + 1 | F m = p b s b s + 1 | F m , where 1 r , s 2 θ 1 - 1 . In the vertex’s position the similarities are in p b u | F m = p b v | F m , where 1 u 2 θ 1 and 1 v 2 θ 1 - 3 .

Case19: Assume that F m { a δ , b j : δ = 1 , 2 , , 2 θ 3 - 3 , j = 1 , 2 , , 2 θ 1 - 3 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r b r + 1 | F m = p b s b s + 1 | F m , where 1 r 2 θ 1 - 1 , 1 s 2 θ 1 - 4 . In the vertex’s position the similarities are in p a u | F m = p a v | F m , where 1 u 2 θ 3 and 1 v 2 θ 3 - 3 .

Case20: Assume that F m { a δ , c j : δ = 1 , 2 , , 2 θ 3 - 3 , j = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p b r b r + 1 | F m = p b s b s + 1 | F m , where 1 r 2 θ 1 - 1 , 1 s 2 θ 1 - 4 . In the vertex’s position the similarities are in p b u | F m = p b v | F m , where 1 u , v 2 θ 1 .

Case21: Assume that F m { b δ , c j : δ = 1 , 2 , , 2 θ 1 - 3 , j = 1 , 2 , , 2 θ 2 - 1 } , considering the constraint that, according to the demand of our theorem | F m | = 3 . In the same vertex’s position and/or edge’s position, the outcome is inferred and our supposition is contradicted by the fact that p a r a r + 1 | F m = p a s a s + 1 | F m , where 1 r , s 2 θ 1 . In the vertex’s position the similarities are in p c u | F m = p c v | F m , where 1 u , v 2 θ 2 - 1 .

By the given positions p . | F m of all 4 θ 1 + θ 2 + θ 3 - 8 -nodes and 5 θ 1 + θ 2 + θ 3 - 11 -edges of T θ 1 , θ 2 , θ 3 graph of benzenoid tripod with θ 1 , θ 2 , θ 3 3 , in regards to F m , are unique and no two nodes, no two edges and not a single edge with a vertex have same position p . As a result, we may infer that the nodes and edges of T θ 1 , θ 2 , θ 3 have been resolved with four vertices. We also checked that the mixed resolving set F m with F m = 3 are resulted in with either two edges, two vertices or a single edge with a vertex have same position p .As a result, we may infer that the nodes and edges of T θ 1 , θ 2 , θ 3 with four vertices. It is finalized that the subset of mixed metric resolvability has minimal members and the graph T θ 1 , θ 2 , θ 3 has cardinal mixed metric dimension. □

Remark 2

If T θ 1 , θ 2 , θ 3 is a benzenoid tripod graph with θ 1 , θ 2 , θ 3 3 , then dim m T θ 1 , θ 2 , θ 3 = 4 .

Proof

As based on the definition of mixed metric dimension, the concept is solemnly based on the selected subset ( F m ) chooses in a manner that each edge and vertex have distinct location in regards to the chosen vertices in subset. The Lemma 2.2 shows and proved the chosen subset for the mixed metric resolving set and their hardness to be chosen with the condition of minimality. We proved in that lemma the subset F m = { a 1 , a 2 θ 3 , b 2 θ 1 , c 2 θ 2 - 1 } is one of the candidate for the mixed metric resolving set for a particular benzenoid tripod or T θ 1 , θ 2 , θ 3 graph for all the possible combinatorial values of with any of θ 1 , θ 2 , θ 3 3 . Moreover, we discussed in the same lemma that F m = 4 is fulfilling the minimality conditions on their members. It is impossible to get a subset with three members in a selected subset. It is sufficient to verify what we assert in the assertion that the mixed metric dimension of the benzenoid tripod is three, which concludes the proof. □

Benzenoid Tripod with { θ 1 , θ 2 , θ 3 } = { 3 , 3 , 4 } .
Fig. 1
Benzenoid Tripod with { θ 1 , θ 2 , θ 3 } = { 3 , 3 , 4 } .

3

3 Conclusion

The study of intricate chemical networks and structures in their most fundamental forms has become easier thanks to only the field of mathematical chemistry, particularly graph theoretical chemistry. Resolvability is a parameter that controls how the whole node and edge set reconfigures itself into distinct ensembles to called or accessed them. A parameter having this feature is called as the mixed metric dimension, which transforms each node and edge of a structure into a unique shape. In this paper, we look at the benzenoid tripod structure in order to find the smallest edge and node combined resolving set. For this structure, we determined that the node and edge combined resolving set has a constant and precise number of members. In the scope of future work, this work can be done for any regular polygons instead of hexagons. This direction will be quite interesting and this help for readers.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Ahmad, Ali, Husain, Sadia, Azeem, Muhammad, Elahi, Kashif, Siddiqui, M.K., 2021. Computation of edge resolvability of benzenoid tripod structure 2021, 1–8.
  2. , , , , . M-polynomials and topological indices of zigzagand rhombic benzenoid systems. Open Chem.. 2018;16(73–78):122-135.
    [Google Scholar]
  3. , , . Metric-based resolvability of polycyclic aromatic hydrocarbons. Eur. Phys. J. Plus. 2021;136(395)
    [Google Scholar]
  4. , , , , . Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math.. 2000;105:99-113.
    [Google Scholar]
  5. , , , . The partition dimension of graph. Aequationes Math.. 2000;59:45-54.
    [Google Scholar]
  6. , , , . Zhang–zhang polynomials of various classes of benzenoid systems. MATCH Commun. Math. Comput. Chem.. 2012;68:31-64.
    [Google Scholar]
  7. , , , . On the edge metric dimension of different families of möbius networks. Math. Probl. Eng.. 2021;2021:1-9.
    [Google Scholar]
  8. , , . On the metric dimension of a graph. Ars Comb.. 1976;2:191-195.
    [Google Scholar]
  9. , , , . Approximation complexity of metric dimension problem. J. Discrete Algorithms. 2012;14:214-222.
    [Google Scholar]
  10. , , , , . Computing metric dimension and metric basis of 2 d lattice of alpha-boron nanotubes. Symmetry. 2018;10
    [Google Scholar]
  11. , , , . Computing the upper bounds for the metric dimension of cellulose network. Appl. Math. E-notes. 2019;19:585-605.
    [Google Scholar]
  12. , , , . Novel face index for benzenoid hydrocarbons. Mathematics. 2020;8(312)
    [Google Scholar]
  13. , . Structure-activity maps for visualizing the graph variables arising in drug design. J. Biopharm. Stat.. 1993;3:203-236.
    [Google Scholar]
  14. , . Browsable structure-activity datasets, advances in molecular similarity. JAI Press Connecticut; . p. :153-170.
  15. , , , . Uniquely identifying the edges of a graph: the edge metric dimension. Discrete Appl. Math.. 2018;251:204-220.
    [Google Scholar]
  16. , , , , . Mixed metric dimension of graphs. Appl. Math. Comput.. Dec 2017;314:429-438.
    [Google Scholar]
  17. , , , . Landmarks in graphs. Discrete Appl. Math.. 1996;70(3):217-229.
    [Google Scholar]
  18. , , , , . Metric and fault-tolerant metric dimension of hollow coronoid. IEEE Access. 2021;9:81527-81534.
    [Google Scholar]
  19. , , . Fault-tolerant resolvability of certain crystal structures. Appl. Math.. 2016;7:599-604.
    [Google Scholar]
  20. , , , . Computers and intractability: a guide to the theory of np-completeness. J. Symb. Log.. 1983;48(2):498-500.
    [Google Scholar]
  21. , , , , . On minimum metric dimension of honeycomb networks. J. Discrete Algorithms. 2008;6(1):20-27.
    [Google Scholar]
  22. , , , . On entropy measures of polycyclic hydroxychloroquine used for novel coronavirus (covid-19) treatment. Polycyclic Aromat. Compd. 2020
    [Google Scholar]
  23. , , , . The locating number of hexagonal möbius ladder network. J. Appl. Math. Comput. 2020
    [Google Scholar]
  24. , , , , , . Evolutionary dynamics of group interactions on structured populations: a review. J. R. Soc. Interface. 2013;10(80)
    [Google Scholar]
  25. , , . Coevolutionary games-a mini review. Biosystems. 2010;99(2):109-125.
    [Google Scholar]
  26. , , . Computing the mixed metric dimension of a generalized petersengraph p ( n , 2 ) . Front. Phys.. 2020;8:211.
    [Google Scholar]
  27. , , , . On mixed metric dimension of some path related graphs. IEEE Access. 2020;8:188146-188153.
    [Google Scholar]
  28. , , , . On mixed metric dimension of rotationally symmetric graphs. IEEE Access. 2020;8:11560-11569.
    [Google Scholar]
  29. , , . On metric generators of graphs. Math. Oper. Res.. 2004;29:383-393.
    [Google Scholar]
  30. , , . Computing metric and partition dimension of 2-dimensional lattices of certain nanotubes. J. Comput. Theor. Nanosci.. 2014;11(12):2419-2423.
    [Google Scholar]
  31. , , . Computing the metric and partition dimension of h-naphtalenic and vc5c7 nanotubes. J. Optoelectron. Adv. Mater.. 2015;17:790-794.
    [Google Scholar]
  32. , , , , . Computing topological indices of certain networks. J. Optoelectron. Adv. Mater.. 2016;18:9-10.
    [Google Scholar]
  33. , , . On the metric dimension of silicate stars. In: ARPN J. Eng. Appl. Sci.. . p. :2187-2192.
    [Google Scholar]
  34. Slater, P.J., 1975. Leaves of trees. In: Proceeding of the 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, vol. 14, pp. 549–559.
  35. , , . A combinatory detection problem. Am. Math. Monthly. 1963;70(10):1066-1070.
    [Google Scholar]
  36. , , , , . On resolvability parameters of some wheel-related graphs. J. Chem. (1–9)
    [Google Scholar]
Show Sections