Next Article in Journal
From Time–Frequency to Vertex–Frequency and Back
Previous Article in Journal
A Kronecker Algebra Formulation for Markov Activity Networks with Phase-Type Distributions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid

1
Department of Mathematics, College of Science, Jazan University, New Campus, Jazan 45142, Saudi Arabia
2
College of Computer Science and Information Technology, Jazan University, Jazan 45142, Saudi Arabia
3
Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Multan 60800, Pakistan
4
Department of Aerospace Engineering, Faculty of Engineering, Universiti Putra Malaysia, Seri Kembangan 43400, Malaysia
*
Author to whom correspondence should be addressed.
Submission received: 15 May 2021 / Revised: 5 June 2021 / Accepted: 14 June 2021 / Published: 17 June 2021

Abstract

:
Geometric arrangements of hexagons into six sides of benzenoids are known as coronoid systems. They are organic chemical structures by definition. Hollow coronoids are divided into two types: primitive and catacondensed coronoids. Polycyclic conjugated hydrocarbon is another name for them. Chemical mathematics piques the curiosity of scientists from a variety of disciplines. Graph theory has always played an important role in making chemical structures intelligible and useful. After converting a chemical structure into a graph, many theoretical and investigative studies on structures can be carried out. Among the different parameters of graph theory, the dimension of edge metric is the most recent, unique, and important parameter. Few proposed vertices are picked in this notion, such as all graph edges have unique locations or identifications. Different (edge) metric-based concept for the structure of hollow coronoid were discussed in this study.

1. Introduction

Molecular graph theory is considered a diversified area of chemistry and mathematics, as it deals with application of mathematics for chemical structures. Mathematicians can debate attributes and offer an optimum solution by studying various chemical structures (networks) and their different shapes in the visualization of graphs (typically made of vertex and edge) [1]. Making a graph or converting a graph from a chemical topological (it can be a network or structure) reveals the topology in the simplest or most understandable way. Various previous research have shown that when a chemical network is transformed to a graph, the atoms become vertex and the lines (bonds) connecting the atoms become edges. Finally, this applied mathematics aids in the resolution of complicated puzzles or offers the tools necessary to comprehend them.
There are a variety of approaches to evaluate and research electrical circuits using graph theory, and graph theoretical parameters may be used in electronics. In 1975 , Slater [2,3], presented an effective notion of network visualization known as metric basis or resolving set, in which principle nodes were picked to achieve the whole set of vertices in a unique identity in terms of distance positions. This concept established the groundwork for a slew of graphs and theoretical parameters that have since been used in a variety of electrical, engineering, and chemical areas. The dealing with of the failure of a single principle node and the resolving set provided the way to get a full set of principle nodes to retain their unique position, as specified by [4], and is known as the fault-tolerant resolving set. Partition resolving set [5] is created if the entire set of nodes is distributed into different subsets with the constraint of obtaining the positions for each node is unique. The above notions are renowned resolvability parameters in terms of metric that have been researched for many graphs, networks, and structures.
Computational complexity of the notions of resolvability parameters discussed here falls in the range of non-deterministic polynomial-time hardness problems as addressed in these literatures [5,6,7,8]. The actuality that this notion has a range of useful favors in our daily practicality motivates researchers. The concept of metric dimension has been applied to a variety of problems, including coastguard loran, sonar, and facility location problems [2], and various studies on combinatorial optimization [9]. Pharmaceutical chemistry being the part as a usage of graph theory, as discussed in [8], robot navigation [10], and the weighing problem of coins [11]. Computer networks [12] are all related to this concept. For a more in-depth look at how resolvability parameters are used [13,14], and [3,8,15,16,17] can be studied.
Graph metric dimension is used immensely in the chemical field for studying different structures that is evident from these articles. The V C 5 C 7 nano-tubes and structure of H-Naphtalenic are studied in [18], sharps bounds are computed for the network of cellulose with respect to distance based graph theoretical parameters in [19], α -boron nanotubes derived from two dimensional lattice are studied in [20], and also provide some links for its applications, [21] computed the distance-based metric for the silicate star. Moving towards the edge metric dimension, barycentric subdivision of Cayley graph studied in [22], few work on the convex polytopes structure discussed by [23,24], the wheel graphs related chemical structures are discussed in [25] and a quantitative review between metric its other versions is done in [26], moreover, the seminal work on the edge metric dimension can be found in [27]. The renowned chemical topology of polycyclic aromatic hydrocarbons are discussed in [28], with the conceptualization of resolvability parameters.
Terminologies of graph theory changed from application to application. For example, open circuits and the current sources were labeled as vertices in an electrical circuit, while passive parts along with voltage sources were relabeled by edges. According to [29], edges, called branches or line segments, and the vertices are renamed as simply nodes or principal nodes.
Definition 1
([30,31]). Suppose V , E is an undirected graph of a chemical structure (network) with V is called as set of principal nodes (vertex set) and E is the set of branches (edge set). The distance between two principal nodes ζ 1 , ζ 2 V , denoted as d ζ 1 , ζ 2 is the minimum count of branches between ζ 1 ζ 2 path.
Definition 2
([2,31]). Suppose R V is the subset of principal nodes set and defined as R = { ζ 1 , ζ 2 , , ζ s } , and let a principal node ζ V . The identification or locations I ( ζ | R ) of a principal node ζ with respect to R is actually a s —ordered distances ( d ( ζ , ζ 1 ) , d ( ζ , ζ 2 ) , , d ( ζ , ζ s ) ) . If each principal node from V have unique identification according to the ordered subset R , then this subset renamed as a resolving set of network . The minimum numbers of the elements in the subset R is actually the metric dimension of ℵ and it is denoted by the term d i m .
Definition 3
([31,32]). A principal node ζ V and a branch e = ζ 1 ζ 2 E , the distance between ζ and e is defined as d ( e , ζ ) = m i n { d ( ζ 1 , ζ ) , d ( ζ 2 , ζ ) } . Suppose R e V is the subset of principal nodes set and defined as R e = { ζ 1 , ζ 2 , , ζ s } , and a branch e E . The identification I ( e | R e ) of a branch e with respect to R e is actually a s —tuple distances ( d ( e , ζ 1 ) , d ( e , ζ 2 ) , , d ( e , ζ s ) ) . If each branch from E have unique identification according to R e , then R e is called an edge metric resolving set of network . The minimum count of the elements in R e is called the edge metric dimension of ℵ and it is represented by d i m e .
Definition 4
([33]). An edge metric resolving set R e of a network ℵ is said to be a fault-tolerant edge metric ( R e , f ) if for each ζ R e , R e ζ is also a edge metric resolving set for . The minimum amount of the fault-tolerant edge metric resolving set is known as the fault-tolerant edge metric dimension and described as d i m e , f .
Theorem 1
([33]). Let d i m e , d i m e , f are the edge metric and fault-tolerant edge metric dimension of graph ℵ, respectively. Then
d i m e , f d i m e + 1 .

2. Construction of Hollow Coronoid HC C 1 , C 2 , C 3

Due to a probable relationship with benzenoid, [34] coined the word coronoid in 1987. Because coronoid is a benzenoid with a hole in the middle. Coronoid is a type of polyhex system that has its roots in organic chemistry. A hollow coronoid structure is depicted in Figure 1. When the specific values of moving parameters C 1 = C 2 = C 3 = 3 , kekule is a part of hollow coronoid [35]. A pericondensed benzenoids structure which is known as circumcoronene also among the family of hollow coronoids [36]. A hollow coronoid, as depicted in Figure 1, had total 6 facets C 1 , C 2 , C 3 , C 4 , C 5 , C 6 . It is rooted from the catacondensed coronoids and also belongs to the family of primitive coronoids [37].
In [38], one can find a new form of hollow coronoid topologies. The authors explored some of the structure’s topological features, as well as their relevance. Zigzag-edge coronoid [39] is another name for this structure. The authors talked about several important aspects of hollow coronoid topology. We refer to [40] for the mathematical analysis of coronoid and related structures. The new research effort [41] is for polynomial investigation of hollow coronoid. In this paper, the authors computed several polynomials. The connection between hollow coronoid and polyhex is described in [42]. The authors of this work talked about the mathematical chemistry of coronoid structure. We refer to the lecture notes and books for a better knowledge of the hollow coronoid and its generalizations [35,37].
In this paper, we take a look at a hollow coronoid with C 1 = C 4 , C 2 = C 5 , C 3 = C 6 , with total 6 facets, but the three ( C 1 , C 2 , C 3 ) sides are symmetric to other three ( C 4 , C 5 , C 6 ). This hollow coronoid is referred to as H C C 1 , C 2 , C 3 , with C 1 , C 2 , C 3 2 . The construction had a total of 8 C 1 + C 2 + C 3 3 nodes or vertices, in which 4 C 1 + C 2 + C 3 3 have the same number of vertices as degree two and have the same number of vertices as degree three. The total number of edges is (branches, line segments, or bonds) are 10 C 1 + C 2 + C 3 3 . The hollow coronoid H C C 1 , C 2 , C 3 structure’s vertex and edge set are described as follows:
V H C C 1 , C 2 , C 3 = { a ϵ , a ϵ , : 1 ϵ 2 C 3 1 } { b ϵ , b ϵ , : 1 ϵ 2 C 1 1 } { c ϵ , c ϵ , : 1 ϵ 2 C 2 1 } { d ϵ , d ϵ , : 1 ϵ 2 C 3 3 } { e ϵ , e ϵ , : 1 ϵ 2 C 1 3 } { f ϵ , f ϵ , : 1 ϵ 2 C 2 3 } , E H C C 1 , C 2 , C 3 = { a ϵ a ϵ + 1 , a ϵ a ϵ + 1 , : 1 ϵ 2 C 3 2 } { b ϵ b ϵ + 1 , b ϵ b ϵ + 1 , : 1 ϵ 2 C 1 2 } { c ϵ c ϵ + 1 , c ϵ c ϵ + 1 , : 1 ϵ 2 C 2 2 } { d ϵ d ϵ + 1 , d ϵ d ϵ + 1 , : 1 ϵ 2 C 3 4 } { e ϵ e ϵ + 1 , e ϵ e ϵ + 1 , : 1 ϵ 2 C 1 4 } { f ϵ f ϵ + 1 , f ϵ f ϵ + 1 , : 1 ϵ 2 C 2 4 } { a ϵ + 1 d ϵ , a ϵ + 1 d ϵ , : 1 ϵ odd 2 C 3 3 } { b ϵ + 1 e ϵ , b ϵ + 1 e ϵ , : 1 ϵ odd 2 C 1 3 } { c ϵ + 1 f ϵ , c ϵ + 1 f ϵ , : 1 ϵ odd 2 C 2 3 } { a 1 c 1 , a 1 c 1 , a 2 C 3 1 b 1 , a 2 C 3 1 b 2 C 1 1 , b 2 C 1 1 c 2 C 2 1 , b 1 c 2 C 2 1 , d 1 f 1 , d 1 f 1 , d 2 C 3 3 e 1 , d 2 C 3 3 e 2 C 1 3 , e 2 C 1 3 f 2 C 2 3 , e 2 C 1 3 f 2 C 2 3 , e 1 f 2 C 2 3 } .
To make it easier to grasp, we separated the various callings into groups of vertices. For example, the outside vertices of a hollow coronoid are denoted a ϵ , a ϵ , b ϵ , b ϵ , c ϵ and c ϵ . The vertices inside the hollow coronoid, on the other hand, are d ϵ , d ϵ , e ϵ , e ϵ , f ϵ and f ϵ . We can assign the same tasks to the edges as well.
Furthermore, by merging the vertex and edge sets of H C C 1 , C 2 , C 3 , created above, the vertices marking utilized in the discoveries presented in Figure 1, and the generalized H C C 1 , C 2 , C 3 , may be constructed.

3. The Resolvability of Hollow Coronoid Structure HC C 1 , C 2 , C 3

Given below is the main part of this study and described in Lemma 1. From V H C C 1 , C 2 , C 3 , for the edge resolving set, few vertices are chosen to form a suitable subset.
Lemma 1.
If H C C 1 , C 2 , C 3 is the graph of hollow coronoid setting C 1 , C 2 , C 3 2 , then the edge metric resolving set of H C C 1 , C 2 , C 3 has cardinality three.
Proof. 
Assume R e = { a 1 , b 1 , b 2 C 1 1 } , is the edge metric resolving set with three members in it, for the hollow coronoid H C C 1 , C 2 , C 3 graph. For the prove of this claim, the positions of or the identifications of edge of H C C 1 , C 2 , C 3 , according to R e , are described following.
Supposing ϵ = 1 , 2 , , 2 C 3 2 , the I a ϵ a ϵ + 1 | R e and I a ϵ a ϵ + 1 | R e , are formulated as;
I a ϵ a ϵ + 1 | R e = ϵ 1 , 2 C 3 ϵ 1 , 2 C 3 + C 1 ϵ 3 , I a ϵ a ϵ + 1 | R e = 2 2 C 3 + C 1 3 ϵ , 2 C 1 + C 3 3 ϵ , 2 C 3 ϵ 1 , if ϵ = 1 , 2 , , 2 C 3 3 ; 2 C 3 + C 1 3 , 2 C 1 + C 3 3 ϵ , 2 C 3 1 ϵ , if ϵ = 2 C 3 2 .
Supposing ϵ = 1 , 2 , , 2 C 1 2 , the I b ϵ b ϵ + 1 | R e and I b ϵ b ϵ + 1 | R e , are formulated as;
I b ϵ b ϵ + 1 | R e = ϵ + 2 C 3 1 , ϵ 1 , 2 C 1 1 ϵ , I b ϵ b ϵ + 1 | R e = 2 C 2 1 + ϵ , 2 C 2 + C 3 1 , 2 C 3 + C 1 + C 2 ϵ 5 , if ϵ = 1 ; 2 C 2 1 + ϵ , 2 C 2 + C 3 2 + ϵ , 2 C 3 + C 1 + C 2 ϵ 5 , if ϵ = 2 , 3 , , 2 C 1 3 ; 2 C 2 1 + ϵ , 2 C 2 + C 3 2 + ϵ , 2 C 3 + C 2 1 , if ϵ = 2 C 1 2 .
Supposing ϵ = 1 , 2 , , 2 C 2 2 , the I c ϵ c ϵ + 1 | R e and I c ϵ c ϵ + 1 | R e , are formulated as;
I c ϵ c ϵ + 1 | R e = ϵ , 2 C 3 1 + ϵ , 2 C 3 + C 1 3 , if ϵ = 1 ; ϵ , 2 C 3 1 + ϵ , 2 C 3 + C 1 5 + ϵ , if ϵ = 2 , 3 , , 2 C 2 2 , I c ϵ c ϵ + 1 | R e = 2 2 C 2 + C 1 5 ϵ , 2 C 3 + C 1 3 , 2 C 3 1 + ϵ , if ϵ = 1 ; 2 2 C 2 + C 1 5 ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ , if ϵ = 2 , 3 , , 2 C 2 3 ; 2 C 2 + C 1 1 , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ , if ϵ = 2 C 2 2 .
All the outside edges of H C C 1 , C 2 , C 3 having unique positions or identifications with respect to R e . The outside edges of graph H C C 1 , C 2 , C 3 , given below are positions for the inside edges of same structure.
Supposing ϵ = 1 , 2 , , 2 C 3 4 , the I d ϵ d ϵ + 1 | R e and I d ϵ d ϵ + 1 | R e , are formulated as;
I d ϵ d ϵ + 1 | R e = ϵ + 1 , 2 C 3 1 + ϵ , 2 C 3 + C 1 5 ϵ , I d ϵ d ϵ + 1 | R e = 2 2 C 3 + C 1 4 ϵ , 2 C 3 + C 1 5 ϵ , 2 C 3 1 ϵ .
Supposing ϵ = 1 , 2 , , 2 C 1 4 , the I e ϵ e ϵ + 1 | R e and I e ϵ e ϵ + 1 | R e , are formulated as;
I e ϵ e ϵ + 1 | R e = ϵ + 2 C 3 1 , 1 + ϵ , 2 C 1 1 ϵ , I e ϵ e ϵ + 1 | R e = 2 C 2 1 + ϵ , 2 C 3 + C 2 2 + ϵ , 2 C 3 + C 1 + C 2 7 ϵ .
Supposing ϵ = 1 , 2 , , 2 C 2 4 , the I f ϵ f ϵ + 1 | R e and I f ϵ f ϵ + 1 | R e , are formulated as;
I f ϵ f ϵ + 1 | R e = ϵ + 2 , 2 C 3 1 + ϵ , 2 C 1 + C 3 5 + ϵ , I f ϵ f ϵ + 1 | R e = 2 2 C 2 + C 1 7 ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ .
Similar to the outside edges of H C C 1 , C 2 , C 3 , we are resulted in unique positions for the inside edges as well. Proceedings are the positions of those edges which are joining the inside and outside nodes of H C C 1 , C 2 , C 3 .
Supposing ϵ = 1 , 3 , 5 , , 2 C 3 3 , the I a ϵ + 1 d ϵ | R e and I a ϵ + 1 d ϵ | R e , are formulated as;
I a ϵ + 1 d ϵ | R e = ϵ , 2 C 3 1 ϵ , 2 C 3 + C 1 2 ϵ , I a ϵ + 1 d ϵ | R e = 2 2 C 3 + C 1 7 ϵ , 2 C 3 + C 1 2 ϵ , 2 C 3 1 ϵ .
Supposing ϵ = 1 , 3 , 5 , , 2 C 1 3 , the I b ϵ + 1 e ϵ | R e and I b ϵ + 1 e ϵ | R e , are formulated as;
I b ϵ + 1 e ϵ | R e = ϵ + 2 C 3 1 , ϵ , 2 C 1 1 ϵ , I b ϵ + 1 e ϵ | R e = 2 C 3 1 + ϵ , 2 C 3 + C 2 2 + ϵ , 2 C 3 + C 1 + C 2 3 ϵ .
Supposing ϵ = 1 , 3 , 5 , , 2 C 2 3 , the I c ϵ + 1 f ϵ | R e and I c ϵ + 1 f ϵ | R e , are formulated as;
I c ϵ + 1 f ϵ | R e = ϵ + 2 , 2 C 3 1 + ϵ , 2 C 1 + C 3 5 + ϵ , I c ϵ + 1 f ϵ | R e = 2 2 C 2 + C 1 3 ϵ , 2 C 3 + C 1 5 ϵ , 2 C 3 1 + ϵ .
Table 1 shows the identifications of joint edges.
Identifications of the entire set of line segment of graph H C C 1 , C 2 , C 3 , one can examine by given above that the complete set of branches possesses the unique identifications also fulfil the concept of edge metric resolving set and finalizing that R e = 3 .
Theorem 2.
If H C C 1 , C 2 , C 3 is the graph of hollow coronoid setting C 1 , C 2 , C 3 2 , then the edge metric dimension of H C C 1 , C 2 , C 3 is three.
Proof. 
The graph H C C 1 , C 2 , C 3 , has edge metric dimension three; to prove this assertion, we will implement the renowned double inequality method. In the Lemma 1, we proved that R e = { a 1 , b 1 , b 2 C 1 1 } , is one of the candidate for the edge metric resolving set with three members. For the upper-bound which is resulted in d i m e H C C 1 , C 2 , C 3 3 , making its contradiction, we came to the assertion d i m e H C C 1 , C 2 , C 3 = 2 , suppose there is a volunteer of edge metric resolving set is R e with having two members. Given below are some discussion in the support of this assumption.
Let the index notations, S 1 = { 1 , 2 , , 2 C 3 2 } , S 2 = { 1 , 2 , , 2 C 1 2 } , S 3 = { 1 , 2 , , 2 C 2 2 } , S 4 = { 1 , 2 , , 2 C 3 4 } , S 5 = { 1 , 2 , , 2 C 1 4 } , S 6 = { 1 , 2 , , 2 C 2 4 } , S 7 = { 1 , 3 , 5 , , 2 C 3 3 } , S 8 = { 1 , 3 , 5 , , 2 C 1 3 } and S 9 = { 1 , 3 , 5 , , 2 C 2 3 } .
1 : Supposing | R e | = 2 , and R e { a ϵ : 1 ϵ 2 C 3 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I d m d m + 1 | R e , where δ S 1 and m S 4 .
2 : Supposing | R e | = 2 , and R e { b ϵ : 1 ϵ 2 C 1 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I a m + 1 d m | R e , where δ S 1 and m S 7 .
3 : Supposing | R e | = 2 , and R e { c ϵ : 1 ϵ 2 C 2 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ b δ + 1 | R e = I e m e m + 1 | R e , where δ S 2 and m S 5 .
4 : Supposing | R e | = 2 , and R e { a ϵ : 1 ϵ 2 C 3 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ b δ + 1 | R e = I e m e m + 1 | R e , where δ S 2 and m S 5 .
5 : Supposing | R e | = 2 , and R e { b ϵ : 1 ϵ 2 C 1 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ b δ + 1 | R e = I a m a m + 1 | R e , where δ S 2 and m S 1 .
6 : Supposing | R e | = 2 , and R e { c ϵ : 1 ϵ 2 C 2 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I c δ c δ + 1 | R e = I c m + 1 f m | R e , where δ S 3 and m S 9 .
7 : Supposing | R e | = 2 , and R e { d ϵ : 1 ϵ 2 C 3 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ b δ + 1 | R e = I e m e m + 1 | R e , where δ S 2 and m S 5 .
8 : Supposing | R e | = 2 , and R e { e ϵ : 1 ϵ 2 C 1 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I c m + 1 f m | R e , where δ S 1 and m S 9 .
9 : Supposing | R e | = 2 , and R e { f ϵ : 1 ϵ 2 C 2 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I a m + 1 d m | R e , where δ S 1 and m S 9 .
10 : Supposing | R e | = 2 , and R e { d ϵ : 1 ϵ 2 C 3 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I d m d m + 1 | R e , where δ S 1 and m S 4 .
11 : Supposing | R e | = 2 , and R e { e ϵ : 1 ϵ 2 C 1 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ b δ + 1 | R e = I c m c m + 1 | R e , where δ S 2 and m S 3 .
12 : Supposing | R e | = 2 , and R e { f ϵ : 1 ϵ 2 C 2 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ + 1 d δ | R e = I c m c m + 1 | R e , where δ S 7 and m S 3 .
13 : Supposing | R e | = 2 , and R e { a ϵ , b j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 1 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ b δ + 1 | R e = I b m + 1 e m | R e , where δ S 2 and m S 8 .
14 : Supposing | R e | = 2 , and R e { a ϵ , c j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 2 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I a m a m + 1 , where δ , m S 1 .
15 : Supposing | R e | = 2 , and R e { a ϵ , a j : 1 ϵ , j 2 C 3 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I a m + 1 d m | R e , where δ S 1 and m S 7 .
16 : Supposing | R e | = 2 , and R e { a ϵ , b j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 1 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ + 1 e δ | R e = I b m b m + 1 | R e , where δ S 8 and m S 2 .
17 : Supposing | R e | = 2 , and R e { a ϵ , c j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 2 1 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I c δ + 1 f δ | R e = I c m c m + 1 | R e , where δ S 9 and m S 3 .
18 : Supposing | R e | = 2 , and R e { a ϵ , d j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 3 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ + 1 e δ | R e = I e m e m + 1 | R e , where δ S 8 and m S 5 .
19 : Supposing | R e | = 2 , and R e { a ϵ , e j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 1 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I d m d m + 1 | R e , where δ S 1 and m S 4 .
20 : Supposing | R e | = 2 , and R e { a ϵ , f j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 2 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I b δ b δ + 1 | R e = I e m e m + 1 | R e , where δ S 2 and m S 5 .
21 : Supposing | R e | = 2 , and R e { a ϵ , d j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 3 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I a δ a δ + 1 | R e = I d m d m + 1 | R e , where δ S 1 and m S 4 .
22 : Supposing | R e | = 2 , and R e { a ϵ , e j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 1 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I c δ + 1 f δ | R e = I c m c m + 1 | R e , where δ S 9 and m S 3 .
23 : Supposing | R e | = 2 , and R e { a ϵ , f j : 1 ϵ 2 C 3 1 , 1 ϵ 2 C 2 3 } V H C C 1 , C 2 , C 3 . This example indicated that | R e | 2 , with reasoning of I c δ + 1 f δ | R e = I c m c m + 1 | R e , where δ S 9 and m S 3 .
Analogously, from the above discussion we can observe that we are unable to get a single candidate from the possible combinations which are V H C C 1 , C 2 , C 3 C 2 = V H C C 1 , C 2 , C 3 ! 2 ! V H C C 1 , C 2 , C 3 2 ! = 8 C 1 + C 2 + C 3 3 ! 2 × 8 C 1 + C 2 + C 3 3 ! of the set of all principle nodes of hollow coronoid graph H C C 1 , C 2 , C 3 . This indicated that the edge metric dimension of H C C 1 , C 2 , C 3 , 2 is does not exist. Hence; d i m e H C C 1 , C 2 , C 3 3 .
By summing up both acquired inequalities, we examine the fact that
d i m e H C C 1 , C 2 , C 3 = 3 .
Lemma 2.
If H C C 1 , C 2 , C 3 is the graph of hollow coronoid setting C 1 , C 2 , C 3 2 , then the fault-tolerant edge metric resolving set of H C C 1 , C 2 , C 3 has cardinality four.
Proof. 
Assume R e , f = { a 1 , b 1 , b 2 C 1 1 , e 2 C 1 3 } , is the fault-tolerant edge metric resolving set with four members in it, for the hollow coronoid H C C 1 , C 2 , C 3 graph. For the prove of this claim, the positions of or the identifications of edge of H C C 1 , C 2 , C 3 , according to R e , f , are described following.
We divide the proof into two following cases on the values of C 1 , C 2 and C 3 .
1 : When C 1 = 2 , 3 and C 2 = C 3 = 2 .
Supposing ϵ = 1 , 2 , , 2 C 3 2 , the I a ϵ a ϵ + 1 | R e , f and I a ϵ a ϵ + 1 | R e , f , are formulated as;
I a ϵ a ϵ + 1 | R e , f = ϵ 1 , 2 C 3 ϵ 1 , 2 C 3 + C 1 ϵ 3 , 2 C 1 + 1 , if ϵ = 1 ; ϵ 1 , 2 C 3 ϵ 1 , 2 C 3 + C 1 ϵ 3 , 2 C 1 + 1 , if ϵ = 2 , 3 , , 2 C 3 2 . I a ϵ a ϵ + 1 | R e , f = 2 2 C 3 + C 1 3 ϵ , 2 C 1 + C 3 3 ϵ , 2 C 3 ϵ 1 , ϵ 1 , if ϵ = 1 ; 2 2 C 3 + C 1 3 ϵ , 2 C 1 + C 3 3 ϵ , 2 C 3 ϵ 1 , 2 C 2 , ϵ 1 , if ϵ = 2 , 3 , , 2 C 3 3 ; 2 C 3 + C 1 3 , 2 C 1 + C 3 3 ϵ , 2 C 3 1 ϵ , ϵ 1 , if ϵ = 2 C 3 2 .
Supposing ϵ = 1 , 2 , , 2 C 1 2 , the I b ϵ b ϵ + 1 | R e , f and I b ϵ b ϵ + 1 | R e , f , are formulated as;
I b ϵ b ϵ + 1 | R e , f = ϵ + 2 C 3 1 , ϵ 1 , 2 C 1 1 ϵ , 2 C 1 + 1 ϵ , I b ϵ b ϵ + 1 | R e , f = 2 C 2 1 + ϵ , 2 C 2 + C 3 1 , 2 C 3 + C 1 + C 2 ϵ 5 , 2 C 1 + 1 ϵ , if ϵ = 1 ; 2 C 2 1 + ϵ , 2 C 2 + C 3 2 + ϵ , 2 C 3 + C 1 + C 2 ϵ 5 , 2 C 1 + 1 ϵ , if ϵ = 2 , 3 , , 2 C 1 3 ; 2 C 2 1 + ϵ , 2 C 2 + C 3 2 + ϵ , 2 C 3 + C 2 1 , 2 C 1 + 1 ϵ , if ϵ = 2 C 1 2 .
Supposing ϵ = 1 , 2 , , 2 C 2 2 , the I c ϵ c ϵ + 1 | R e , f and I c ϵ c ϵ + 1 | R e , f , are formulated as;
I c ϵ c ϵ + 1 | R e , f = ϵ , 2 C 3 1 + ϵ , 2 C 3 + C 1 3 , 2 C 1 + 2 , if ϵ = 1 ; ϵ , 2 C 3 1 + ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 1 + 2 , if ϵ = 2 , 3 , , 2 C 2 2 , I c ϵ c ϵ + 1 | R e , f = 2 2 C 2 + C 1 5 ϵ , 2 C 3 + C 1 3 , 2 C 3 1 + ϵ , 1 , if ϵ = 1 ; 2 2 C 2 + C 1 5 ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ , 1 , if ϵ = 2 , 3 , , 2 C 2 3 ; 2 C 2 + C 1 1 , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ , 1 , if ϵ = 2 C 2 2 .
All the outside edges of H C C 1 , C 2 , C 3 having unique positions or identifications with respect to R e , f . The outside edges of graph H C C 1 , C 2 , C 3 , given below are positions for the inside edges of same structure.
Supposing ϵ = 1 , 2 , , 2 C 1 4 , the I e ϵ e ϵ + 1 | R e , f and I e ϵ e ϵ + 1 | R e , f , are formulated as;
I e ϵ e ϵ + 1 | R e , f = ϵ + 2 C 3 1 , 1 + ϵ , 2 C 1 1 ϵ , 5 ϵ , I e ϵ e ϵ + 1 | R e , f = 2 C 2 1 + ϵ , 2 C 3 + C 2 2 + ϵ , 2 C 3 + C 1 + C 2 7 ϵ , 5 ϵ .
Similar to the outside edges of H C C 1 , C 2 , C 3 , we are resulted in unique positions for the inside edges as well. Proceedings are the positions of those edges which are joining the inside and outside nodes of H C C 1 , C 2 , C 3 .
Supposing ϵ = 1 , 3 , 5 , , 2 C 3 3 , the I a ϵ + 1 d ϵ | R e , f and I a ϵ + 1 d ϵ | R e , f , are formulated as;
I a ϵ + 1 d ϵ | R e , f = ϵ , 2 C 3 1 ϵ , 2 C 3 + C 1 2 ϵ , 2 C 1 , I a ϵ + 1 d ϵ | R e , f = 2 2 C 3 + C 1 7 ϵ , 2 C 3 + C 1 2 ϵ , 2 C 3 1 ϵ , 1 .
Supposing ϵ = 1 , 3 , 5 , , 2 C 1 3 , the I b ϵ + 1 e ϵ | R e , f and I b ϵ + 1 e ϵ | R e , f , are formulated as;
I b ϵ + 1 e ϵ | R e , f = ϵ + 2 C 3 1 , ϵ , 2 C 1 1 ϵ , 2 C 1 ϵ , I b ϵ + 1 e ϵ | R e , f = 2 C 3 1 + ϵ , 2 C 3 + C 2 2 + ϵ , 2 C 3 + C 1 + C 2 3 ϵ , 2 C 1 + 1 ϵ .
Supposing ϵ = 1 , 3 , 5 , , 2 C 2 3 , the I c ϵ + 1 f ϵ | R e , f and I c ϵ + 1 f ϵ | R e , f , are formulated as;
I c ϵ + 1 f ϵ | R e , f = ϵ + 2 , 2 C 3 1 + ϵ , 2 C 1 + C 3 5 + ϵ , 2 C 1 + 1 , I c ϵ + 1 f ϵ | R e , f = 2 2 C 2 + C 1 3 ϵ , 2 C 3 + C 1 5 ϵ , 2 C 3 1 + ϵ , 2 .
Table 2 shows the identifications of joint edges.
2 : When C 1 , C 2 , C 3 3 .
Supposing ϵ = 1 , 2 , , 2 C 3 2 , the I a ϵ a ϵ + 1 | R e , f and I a ϵ a ϵ + 1 | R e , f , are formulated as;
I a ϵ a ϵ + 1 | R e , f = ϵ 1 , 2 C 3 ϵ 1 , 2 C 3 + C 1 ϵ 3 , 2 C 1 + C 2 5 , if ϵ = 1 ; ϵ 1 , 2 C 3 ϵ 1 , 2 C 3 + C 1 ϵ 3 , 2 C 1 + C 2 7 + ϵ , if ϵ = 2 , 3 , , 2 C 3 2 . I a ϵ a ϵ + 1 | R e , f = 2 2 C 3 + C 1 3 ϵ , 2 C 1 + C 3 3 ϵ , 2 C 3 ϵ 1 , 2 C 2 1 , if ϵ = 1 ; 2 2 C 3 + C 1 3 ϵ , 2 C 1 + C 3 3 ϵ , 2 C 3 ϵ 1 , 2 C 2 3 + ϵ , if ϵ = 2 , 3 , , 2 C 3 3 ; 2 C 3 + C 1 3 , 2 C 1 + C 3 3 ϵ , 2 C 3 1 ϵ , 2 C 2 3 + ϵ , if ϵ = 2 C 3 2 .
Supposing ϵ = 1 , 2 , , 2 C 1 2 , the I b ϵ b ϵ + 1 | R e , f and I b ϵ b ϵ + 1 | R e , f , are formulated as;
I b ϵ b ϵ + 1 | R e , f = ϵ + 2 C 3 1 , ϵ 1 , 2 C 1 1 ϵ , 2 C 1 + C 2 + C 3 7 ϵ , if ϵ = 1 , 2 , , 2 C 1 3 ; ϵ + 2 C 3 1 , ϵ 1 , 2 C 1 1 ϵ , 2 C 2 + C 3 2 , if ϵ = 2 C 1 2 . I b ϵ b ϵ + 1 | R e , f = 2 C 2 1 + ϵ , 2 C 2 + C 3 1 , 2 C 3 + C 1 + C 2 ϵ 5 , 2 C 1 1 ϵ , if ϵ = 1 ; 2 C 2 1 + ϵ , 2 C 2 + C 3 2 + ϵ , 2 C 3 + C 1 + C 2 ϵ 5 , 2 C 1 1 ϵ , if ϵ = 2 , 3 , , 2 C 1 3 ; 2 C 2 1 + ϵ , 2 C 2 + C 3 2 + ϵ , 2 C 3 + C 2 1 , 2 , if ϵ = 2 C 1 2 .
Supposing ϵ = 1 , 2 , , 2 C 2 2 , the I c ϵ c ϵ + 1 | R e , f and I c ϵ c ϵ + 1 | R e , f , are formulated as;
I c ϵ c ϵ + 1 | R e , f = ϵ , 2 C 3 1 + ϵ , 2 C 3 + C 1 3 , 2 C 2 + C 1 5 ϵ , if ϵ = 1 ; ϵ , 2 C 3 1 + ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 2 + C 1 5 ϵ , if ϵ = 2 , 3 , , 2 C 2 3 ; ϵ , 2 C 3 1 + ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 1 1 , if ϵ = 2 C 2 2 , I c ϵ c ϵ + 1 | R e , f = 2 2 C 2 + C 1 5 ϵ , 2 C 3 + C 1 3 , 2 C 3 1 + ϵ , 2 C 2 1 ϵ , if ϵ = 1 ; 2 2 C 2 + C 1 5 ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ , 2 C 2 1 ϵ , if ϵ = 2 , 3 , , 2 C 2 3 ; 2 C 2 + C 1 1 , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ , 3 , if ϵ = 2 C 2 2 .
All the outside edges of H C C 1 , C 2 , C 3 having unique positions or identifications with respect to R e , f . The outside edges of graph H C C 1 , C 2 , C 3 , given below are positions for the inside edges of same structure.
Supposing ϵ = 1 , 2 , , 2 C 3 4 , the I d ϵ d ϵ + 1 | R e , f and I d ϵ d ϵ + 1 | R e , f , are formulated as;
I d ϵ d ϵ + 1 | R e , f = ϵ + 1 , 2 C 3 1 + ϵ , 2 C 3 + C 1 5 ϵ , 2 C 3 + C 1 7 + ϵ , I d ϵ d ϵ + 1 | R e , f = 2 2 C 3 + C 1 4 ϵ , 2 C 3 + C 1 5 ϵ , 2 C 3 1 ϵ , 2 C 2 3 + ϵ .
Supposing ϵ = 1 , 2 , , 2 C 1 4 , the I e ϵ e ϵ + 1 | R e , f and I e ϵ e ϵ + 1 | R e , f , are formulated as;
I e ϵ e ϵ + 1 | R e , f = ϵ + 2 C 3 1 , 1 + ϵ , 2 C 1 1 ϵ , 2 C 3 + C 1 + C 2 9 ϵ , I e ϵ e ϵ + 1 | R e , f = 2 C 2 1 + ϵ , 2 C 3 + C 2 2 + ϵ , 2 C 3 + C 1 + C 2 7 ϵ , 2 C 1 1 ϵ .
Supposing ϵ = 1 , 2 , , 2 C 2 4 , the I f ϵ f ϵ + 1 | R e , f and I f ϵ f ϵ + 1 | R e , f , are formulated as;
I f ϵ f ϵ + 1 | R e , f = ϵ + 2 , 2 C 3 1 + ϵ , 2 C 1 + C 3 5 + ϵ , 2 C 2 + C 1 7 ϵ , I f ϵ f ϵ + 1 | R e , f = 2 2 C 2 + C 1 7 ϵ , 2 C 3 + C 1 5 + ϵ , 2 C 3 1 + ϵ , 2 C 2 3 ϵ .
Similar to the outside edges of H C C 1 , C 2 , C 3 , we are resulted in unique positions for the inside edges as well. Proceedings are the positions of those edges which are joining the inside and outside nodes of H C C 1 , C 2 , C 3 .
Supposing ϵ = 1 , 3 , 5 , , 2 C 3 3 , the I a ϵ + 1 d ϵ | R e , f and I a ϵ + 1 d ϵ | R e , f , are formulated as;
I a ϵ + 1 d ϵ | R e , f = ϵ , 2 C 3 1 ϵ , 2 C 3 + C 1 2 ϵ , 2 C 1 + C 2 7 + ϵ , I a ϵ + 1 d ϵ | R e , f = 2 2 C 3 + C 1 7 ϵ , 2 C 3 + C 1 2 ϵ , 2 C 3 1 ϵ , 2 C 2 3 + ϵ .
Supposing ϵ = 1 , 3 , 5 , , 2 C 1 3 , the I b ϵ + 1 e ϵ | R e , f and I b ϵ + 1 e ϵ | R e , f , are formulated as;
I b ϵ + 1 e ϵ | R e , f = ϵ + 2 C 3 1 , ϵ , 2 C 1 1 ϵ , 2 C 2 + C 3 + C 1 4 ϵ , I b ϵ + 1 e ϵ | R e , f = 2 C 3 1 + ϵ , 2 C 3 + C 2 2 + ϵ , 2 C 3 + C 1 + C 2 3 ϵ , 2 C 1 3 ϵ .
Supposing ϵ = 1 , 3 , 5 , , 2 C 2 3 , the I c ϵ + 1 f ϵ | R e , f and I c ϵ + 1 f ϵ | R e , f , are formulated as;
I c ϵ + 1 f ϵ | R e , f = ϵ + 2 , 2 C 3 1 + ϵ , 2 C 1 + C 3 5 + ϵ , 2 C 2 + C 1 3 ϵ , I c ϵ + 1 f ϵ | R e , f = 2 2 C 2 + C 1 3 ϵ , 2 C 3 + C 1 5 ϵ , 2 C 3 1 + ϵ , 2 C 2 1 ϵ .
Table 2 shows the identifications of joint edges.
Identifications of the entire set of line segment of graph H C C 1 , C 2 , C 3 , one can examine by given above that the complete set of branches possesses the unique positions also fulfil the concept of edge metric resolving set and finalizing that R e , f = 4 .
Theorem 3.
If H C C 1 , C 2 , C 3 is the graph of hollow coronoid setting C 1 , C 2 , C 3 2 , then the fault-tolerant edge metric dimension of H C C 1 , C 2 , C 3 is four.
Proof. 
The graph H C C 1 , C 2 , C 3 , has fault-tolerant edge metric dimension four, to prove this assertion we will implement the renowned double inequality method. In the Lemma 1, we proved that R e , f = { a 1 , b 1 , b 2 C 1 1 , e 2 C 1 3 } , is one of the candidate for the fault-tolerant edge metric resolving set with four members. For the upper-bound which is resulted in d i m e , f H C C 1 , C 2 , C 3 4 , making its contradiction, we came to the assertion d i m e , f H C C 1 , C 2 , C 3 = 3 , now and by referring the Theorem 1 and Theorem 2 concluded that 3 fault-tolerant edge metric dimension of H C C 1 , C 2 , C 3 , is does not exist. Hence; d i m e , f H C C 1 , C 2 , C 3 4 .
By summing up both acquired inequalities, we examine the fact that
d i m e , f H C C 1 , C 2 , C 3 = 4 .

4. Conclusions

The idea of studying chemical structures using graph theory terminologies is appealing and advantageous. It facilitates chemical researchers’ exploration of various chemical networks and topologies in a more systematic and accessible manner. We estimated the edge metric and fault-tolerant edge metric dimension of a hollow coronoid topology with six sides. The above parameters are constant and independent of the hollow coronoid vertices, as shown.

Author Contributions

A.N.A.K. contributed towards conceptualization, data curation, funding acquisition, project administration, and resources. A.A. contributed towards investigation, methodology, conceptualization, supervision, and validation. M.I. contributed towards investigation, methodology, resources, and validation. M.A. contributed towards investigation, methodology, conceptualization, and validation. All authors read and approved the initial and final version of the paper. All authors have read and agreed to the published version of the manuscript.

Funding

There is no funding associated with this manuscript.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Joita, D.-M.; Jäntschi, L. Extending the characteristic polynomial for characterization of C20 Fullerene Congeners. Mathematics 2017, 5, 84. [Google Scholar] [CrossRef] [Green Version]
  2. Slater, P.J. Leaves of trees, Proceeding of the 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing. Congr. Numer. 1975, 14, 549–559. [Google Scholar]
  3. Harary, F.; Melter, R.A. On the metric dimension of a graph. ARS Comb. 1976, 2, 191–195. [Google Scholar]
  4. Cáceres, J.; Hernando, C.; Mora, M.; Pelayo, I.M.; Puertas, M.L.; Seara, C.; Wood, D.R. On the metric dimension of cartesian products of graphs. SIAM J. Discret. Math. 2007, 21, 423–441. [Google Scholar] [CrossRef] [Green Version]
  5. Chartrand, G.; Salehi, E.; Zhang, P. The partition dimension of a graph. Aequ. Math. 2000, 59, 45–54. [Google Scholar] [CrossRef]
  6. Hauptmann, M.; Schmied, R.; Viehmann, C. Approximation complexity of metric dimension problem. J. Discret. Algorithms 2012, 14, 214–222. [Google Scholar] [CrossRef] [Green Version]
  7. Lewis, H.R.; Garey, M.R.; Johnson, D.S. Computers and intractability. A guide to the theory of NP-completeness. J. Symb. Log. 1983, 48, 498–500. [Google Scholar] [CrossRef]
  8. Chartrand, G.; Eroh, L.; Johnson, M.A.; Oellermann, O.R. Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 2000, 105, 99–113. [Google Scholar] [CrossRef] [Green Version]
  9. Sebő, A.; Tannier, E. On metric generators of graphs. Math. Oper. Res. 2004, 29, 383–393. [Google Scholar] [CrossRef]
  10. Khuller, S.; Raghavachari, B.; Rosenfeld, A. Landmarks in graphs. Discret. Appl. Math. 1996, 70, 217–229. [Google Scholar] [CrossRef] [Green Version]
  11. Söderberg, S.; Shapiro, H.S. A combinatory detection problem. Am. Math. Mon. 1963, 70, 1066–1070. [Google Scholar] [CrossRef]
  12. Manuel, P.; Bharati, R.; Rajasingh, I. On minimum metric dimension of honeycomb networks. J. Discret. Algorithms 2008, 6, 20–27. [Google Scholar] [CrossRef] [Green Version]
  13. Perc, M.; Gómez-Gardenes, J.; Szolnoki, A.; Floría, L.M.; Moreno, Y. Evolutionary dynamics of group interactions on structured populations: A review. J. R. Soc. Interface 2013, 10, 20120997. [Google Scholar] [CrossRef] [Green Version]
  14. Perc, M.; Szolnoki, A. Coevolutionary games—A mini review. BioSystems 2010, 99, 109–125. [Google Scholar] [CrossRef] [Green Version]
  15. Johnson, M. Structure-activity maps for visualizing the graph variables arising in drug design. J. Biopharm. Stat. 1993, 3, 203–236. [Google Scholar] [CrossRef]
  16. Johnson, M. Browsable structure-activity datasets. Adv. Mol. Similarity 1998, 2, 153–170. [Google Scholar]
  17. Melter, R.A.; Tomescu, I. Metric bases in digital geometry. Comput. Vis. Graph. Image Process. 1984, 25, 113–121. [Google Scholar] [CrossRef]
  18. Imran, S.; Siddiqui, M.K.; Imran, M.; Hussain, M. Computing the Upper Bounds for the Metric Dimension of Cellulose Network. Appl. Math. E Notes 2019, 19, 585–605. [Google Scholar]
  19. Siddiqui, H.M.A.; Imran, M. Computing the metric and partition dimension of H-Naphtalenic and VC5C7 nanotubes. J. Optoelectron. Adv. Mater. 2015, 17, 790–794. [Google Scholar]
  20. Hussain, Z.; Munir, M.; Chaudhary, M.; Kang, S.M. Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes. Symmetry 2018, 10, 300. [Google Scholar] [CrossRef] [Green Version]
  21. Simonraj, F.; George, A. On the metric Dimension of silicate stars. ARPN J. Eng. Appl. Sci. 2015, 10, 2187–2192. [Google Scholar]
  22. Koam, A.N.; Ahmad, A. Barycentric subdivision of Cayley graphs with constant edge metric dimension. IEEE Access 2020, 8, 80624–80628. [Google Scholar] [CrossRef]
  23. Zhang, Y.; Gao, S. On the edge metric dimension of convex polytopes and its related graphs. J. Comb. Optim. 2020, 39, 334–350. [Google Scholar] [CrossRef]
  24. Ahsan, M.; Zahid, Z.; Zafar, S.; Rafiq, A.; Sindhu, M.; Umar, M. Computing the edge metric dimension of convex polytopes related graphs. J. Math. Comput. Sci. 2021, 22, 174–188. [Google Scholar] [CrossRef]
  25. Yang, B.; Rafiullah, M.; Siddiqui, H.M.A.; Ahmad, S. On Resolvability parameters of some wheel-related graphs. J. Chem. 2019, 2019, 9259032. [Google Scholar] [CrossRef]
  26. Raza, Z.; Bataineh, M.S. The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph. Asian Eur. J. Math. 2020, 14, 2150062. [Google Scholar] [CrossRef]
  27. Yero, I.G. Vertices, edges, distances and metric dimension in graphs. Electron. Notes Discret. Math. 2016, 55, 191–194. [Google Scholar] [CrossRef]
  28. Azeem, M.; Nadeem, M.F. Metric-based resolvability of polycyclic aromatic hydrocarbons. Eur. Phys. J. Plus 2021, 136, 1–14. [Google Scholar] [CrossRef]
  29. Zhang, R.; Yang, B.; Shao, Z.; Yang, D.; Ming, P.; Li, B.; Ji, H.; Zhang, C. Graph theory model and mechanism analysis of carbon fiber paper conductivity in fuel cell based on physical structure. J. Power Sources 2021, 491, 229546. [Google Scholar] [CrossRef]
  30. Nadeem, M.F.; Azeem, M.; Khalil, A. The locating number of hexagonal Möbius ladder network. J. Appl. Math. Comput. 2021, 66, 149–165. [Google Scholar] [CrossRef]
  31. Koam, A.; Ahmad, A.; Abdelhag, M.E.; Azeem, M. Metric and Fault-Tolerant Metric Dimension of Hollow Coronoid. IEEE Access 2021, 9, 81527–81534. [Google Scholar] [CrossRef]
  32. Kelenc, A.; Tratnik, N.; Yero, I.G. Uniquely identifying the edges of a graph: The edge metric dimension. Discret. Appl. Math. 2018, 251, 204–220. [Google Scholar] [CrossRef] [Green Version]
  33. Liu, X.; Ahsan, M.; Zahid, Z.; Ren, S. Fault-tolerant edge metric dimension of certain families of graphs. AIMS Math. 2021, 6, 1140–1152. [Google Scholar] [CrossRef]
  34. Brunvoll, J.; Cyvin, B.N.; Cyvin, S.J. Enumeration and classification of coronoid hydrocarbons. J. Chem. Inf. Comput. Sci. 1987, 27, 14–21. [Google Scholar] [CrossRef]
  35. Cyvin, S.J.; Brunvoll, J.; Cyvin, B.N. Lecture Notes in Chemistry: Theory of Coronoid Hydrocarbons; Springer: Berlin/Heidelberg, Germany, 1991. [Google Scholar]
  36. Shabbir, A.; Azeem, M. On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube. IEEE Access 2021, 9, 55644–55653. [Google Scholar] [CrossRef]
  37. Cyvin, S.J.; Brunvoll, J.; Chen, R.S.; Cyvin, B.N.; Zhang, F.J. Lecture Notes in Chemistry: Theory of Coronoid Hydrocarbons II; Springer: Berlin/Heidelberg, Germany, 1994. [Google Scholar]
  38. Sarkar, P.; Pal, A.; De, N. The (a,b)-Zagreb index of line graphs of subdivision graphs of some molecular structures. Int. J. Math. Ind. 2020, 12, 2050006. [Google Scholar] [CrossRef]
  39. Gao, W.; Jamil, M.K.; Javed, A.; Farahani, M.R.; Imran, M. Inverse sum indeg index of the line graphs of subdivision graphs of some chemical structures. UPB Sci. Bull. Ser. B 2018, 80, 97–104. [Google Scholar]
  40. Cyvin, S.J.; Brunvoll, J.; Cyvin, B.N. Topological aspects of benzenoid and coronoids, including snowflakes and laceflowers. Comput. Math. Appl. 1989, 17, 355–374. [Google Scholar] [CrossRef] [Green Version]
  41. Afzal, F.; Hussain, S.; Afzal, D.; Hameed, S. M-polynomial and topological indices of zigzag edge coronoid fused by starphene. Open Chem. 2020, 18, 1362–1369. [Google Scholar] [CrossRef]
  42. Dias, J.R. The polyhex/polypent topological paradigm: Regularities in the isomer numbers and topological properties of select subclasses of benzenoid hydrocarbons and related systems. Chem. Soc. Rev. 2010, 39, 1913–1924. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Hollow Coronoid with C 1 = 5 , C 2 = C 3 = 4 .
Figure 1. Hollow Coronoid with C 1 = 5 , C 2 = C 3 = 4 .
Mathematics 09 01405 g001
Table 1. Representation of edges with respect to resolving set R e .
Table 1. Representation of edges with respect to resolving set R e .
I . | R e a 1 b 1 b 2 C 1 1
I a 1 c 1 | R e 0 2 C 3 1 2 C 3 + C 1 3
I d 1 f 1 | R e 2 2 C 3 1 2 C 3 + C 1 5
I a 2 C 3 1 b 1 | R e 2 C 3 1 0 2 C 1 1
I d 2 C 3 3 e 1 | R e 2 C 3 1 2 2 C 1 1
I b 2 C 1 1 a 2 C 3 1 | R e 2 C 3 + C 1 3 2 C 1 1 0
I c 2 C 1 3 d 2 C 3 3 | R e 2 C 3 + C 1 5 2 C 1 1 2
I d 1 f 1 | R e 2 C 3 + C 1 2 2 C 1 1 3
I a 1 c 1 | R e 2 2 C 3 + C 1 3 2 C 1 + C 3 3 2 C 3 1
I e 2 C 1 3 f 2 C 2 3 | R e 2 C 2 + C 1 2 2 C 1 + C 3 + C 2 3 2 C 3 + C 2 2
I b 2 C 1 1 c 2 C 2 1 | R e 2 C 2 + C 1 1 2 C 1 + C 3 + C 2 5 2 C 3 + C 2 1
I c 2 C 2 1 b 1 | R e 2 C 3 1 2 C 3 + C 2 1 2 C 3 + C 2 + C 1 5
I f 2 C 2 3 e 1 | R e 2 C 2 1 2 C 3 + C 2 2 2 C 3 + C 2 + C 1 7
Table 2. Representation of edges with respect to resolving set R e , f .
Table 2. Representation of edges with respect to resolving set R e , f .
I . | R e , f a 1 b 1 b 2 C 1 1 a 1
I a 1 c 1 | R e , f 0 2 C 3 1 2 C 3 + C 1 3 2 C 1 + 1
I d 1 f 1 | R e , f 2 2 C 3 1 2 C 3 + C 1 5 2 C 1
I a 2 C 3 1 b 1 | R e , f 2 C 3 1 0 2 C 1 1 2 C 1 + 1
I d 2 C 3 3 e 1 | R e , f 2 C 3 1 2 2 C 1 1 2 C 1 1
I b 2 C 1 1 a 2 C 3 1 | R e , f 2 C 3 + C 1 3 2 C 1 1 02
I c 2 C 1 3 d 2 C 3 3 | R e , f 2 C 3 + C 1 5 2 C 1 1 22
I d 1 f 1 | R e , f 2 C 3 + C 1 2 2 C 1 1 32
I a 1 c 1 | R e , f 2 2 C 3 + C 1 3 2 C 1 + C 3 3 2 C 3 1 0
I e 2 C 1 3 f 2 C 2 3 | R e , f 2 C 2 + C 1 2 2 C 1 + C 3 + C 2 3 2 C 3 + C 2 2 3
I b 2 C 1 1 c 2 C 2 1 | R e , f 2 C 2 + C 1 1 2 C 1 + C 3 + C 2 5 2 C 3 + C 2 1 3
I c 2 C 2 1 b 1 | R e , f 2 C 3 1 2 C 3 + C 2 1 2 C 3 + C 2 + C 1 5 2 C 1 + 1
I f 2 C 2 3 e 1 | R e , f 2 C 2 1 2 C 3 + C 2 2 2 C 3 + C 2 + C 1 7 2 C 1
I . | R e , f a 1 b 1 b 2 C 1 1 e 2 C 1 3
I a 1 c 1 | R e , f 0 2 C 3 1 2 C 3 + C 1 3 2 C 2 + C 1 3
I d 1 f 1 | R e , f 2 2 C 3 1 2 C 3 + C 1 5 2 C 1 + C 2 7
I a 2 C 3 1 b 1 | R e , f 2 C 3 1 0 2 C 1 1 2 C 1 + C 2 + C 3 4
I d 2 C 3 3 e 1 | R e , f 2 C 3 1 2 2 C 1 1 2 C 1 + C 2 + C 3 5
I b 2 C 1 1 a 2 C 3 1 | R e , f 2 C 3 + C 1 3 2 C 1 1 0 2 C 2 + C 3 2
I c 2 C 1 3 d 2 C 3 3 | R e , f 2 C 3 + C 1 5 2 C 1 1 2 2 C 2 + C 3 3
I d 1 f 1 | R e , f 2 C 3 + C 1 2 2 C 1 1 3 2 C 2 3
I a 1 c 1 | R e , f 2 2 C 3 + C 1 3 2 C 1 + C 3 3 2 C 3 1 2 C 2 1
I e 2 C 1 3 f 2 C 2 3 | R e , f 2 C 2 + C 1 2 2 C 1 + C 3 + C 2 3 2 C 3 + C 2 2 0
I b 2 C 1 1 c 2 C 2 1 | R e , f 2 C 2 + C 1 1 2 C 1 + C 3 + C 2 5 2 C 3 + C 2 1 2
I c 2 C 2 1 b 1 | R e , f 2 C 3 1 2 C 3 + C 2 1 2 C 3 + C 2 + C 1 5 2 C 1 1
I f 2 C 2 3 e 1 | R e , f 2 C 2 1 2 C 3 + C 2 2 2 C 3 + C 2 + C 1 7 2 C 1 2
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Koam, A.N.A.; Ahmad, A.; Ibrahim, M.; Azeem, M. Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid. Mathematics 2021, 9, 1405. https://0-doi-org.brum.beds.ac.uk/10.3390/math9121405

AMA Style

Koam ANA, Ahmad A, Ibrahim M, Azeem M. Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid. Mathematics. 2021; 9(12):1405. https://0-doi-org.brum.beds.ac.uk/10.3390/math9121405

Chicago/Turabian Style

Koam, Ali N. A., Ali Ahmad, Muhammad Ibrahim, and Muhammad Azeem. 2021. "Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid" Mathematics 9, no. 12: 1405. https://0-doi-org.brum.beds.ac.uk/10.3390/math9121405

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop