Skip to content
BY 4.0 license Open Access Published by De Gruyter June 7, 2021

Molecular topological invariants of certain chemical networks

  • Syed Ahtsham Ul Haq Bokhary , Muhammad Imran EMAIL logo , Shehnaz Akhter and Sadia Manzoor

Abstract

Topological descriptors are the graph invariants that are used to explore the molecular topology of the molecular/chemical graphs. In QSAR/QSPR research, physico-chemical characteristics and topological invariants including Randić, atom-bond connectivity, and geometric arithmetic invariants are utilized to corelate and estimate the structure relationship and bioactivity of certain chemical compounds. Graph theory and discrete mathematics have discovered an impressive utilization in the area of research. In this article, we investigate the valency-depended invariants for certain chemical networks like generalized Aztec diamonds and tetrahedral diamond lattice. Moreover, the exact values of invariants for these categories of chemical networks are derived.

1 Introduction

There are many diverse applications of mathematics in electronic and electrical engineering. It relies upon what specific region of electronic and electrical designing you are interested, for instance, there is a masses abstract mathematics invloved in communication, signal processing, network theory, etc. Networks use vertices for communicating with each other. The thoery of networking includes the investigation of the most ideal method of executing a network. Graph theory has given chemists beneficial tools and techniques, such as molecular topological descriptors and molecular topological polynomials. The structure of a molecular graph is constructed with help of molecules and molecular compounds. A molecular graph represents the structural result of a chemical compound in forms of graph theory, in which vertices are denoted by atoms and edges correlate to chemical bonds between their atoms. A newly famous area is cheminformatics which is a common region of mathematics, chemistry, and information science. This new subject describes a relationship between the QSAR and QSPR that are utilized to investigate (in certain degree of accuracy) the theoretical and biological activities of several chemical compounds. In the QSAR/QSPR investigation, the topological invariants like ABC index is known for the prediction of bioactivity of a given chemical compounds.

A topological descriptor is a numeric number achived from different properties of graphs. It also describes the molecular topology of that graph and is not changed under the graph automorphism. The topological indices are generally of two types: one is degree-related and the otheris distance-related. In the degree-related indices, it depends upon the vertex-degree of all vertices and in the distance-related indices, it depends on the distance among the each pair of vertices. It is important to know that a theoretical chemist Wiener (1947) gave the idea of topological indices when he was investigating the characteristics of boiling point of paraffin. Firstly, he termed it as path number but after a bit, it was changed to Wiener index (Wiener, 1947) and the reserch of topological invariants started.

Here, V(B) and E(B) are the vertex and the edge sets of a network B. Some of the terminologies which are used in this paper are given as follows: d(α) presents the degree of αV(B) and Sα=βNB(α)d(β) where NB (α) = {βV(B): αβE(B)}. All the terminologies used in this manuscript are acquired from books (Diudea et al. 2001, Gutman and Polansky, 1986).

Estrada et al. (1998) gave the concept of renowned degree related topological invariant atom-bond connectivit and described as:

(1) ABC(B)=αβE(B)d(α)+d(β)2d(α)d(β)

The other notable degree dependend invariant is geometric-arithmetic index established by Vukičević et al. (2009) and interpreted as:

(2) GA(B)=αβE(B)2d(α)d(β)d(α)+d(β)

In both these indices, first we find the possible degree of all the vertices and then partitined the edges of B depending upon the degree of every end vertex adjacent to edge.

Later, Ghorbani and Hosseinzadeh (2010) presented the 4th kind of ABC invariant by generalizing the idea of ABC index. It is interpreted as:

(3) ABC4(B)=αβE(B)Sα+Sβ2SαSβ

Graovac et al. (2011) generalized the geometric index by defining the fifth kind of GA index in a same way as ABC4 index. The index is written as:

(4) GA5(B)=αβE(B)2SαSβSα+Sβ

In both these indices, first we find the possible degree of all vertices and then partitined the edges of B depending upon the degree of vertices adjacent to every end vertex of each edge.

The first Zagreb index M1 and the second Zagreb index M2 (Reti et al., 2019) for a graph G can be defined as:

M1(G)=vV(G)(d(v))2=uvE(G)(d(u)+d(v)),M2(G)=uvE(G)d(u)d(v)

The neighborhood first and second Zegreb indices (first defined by Reti et al. (2019)) are as follows:

NM1(G)=vV(G)(Sv)2,NM2(G)=uvE(G)SuSv

For more discussion about invariants, see: Ahmad et al. (2017), Alikhani et al. (2014), Akhter and Imran (2016a, 2016b), Akhter et al. (2018, 2019), Bača et al. (2015), Baig et al. (2015a, 2015b), Guirao et al. (2020), Hameed et al. (2019), Hayat and Imran (2014, 2015a, 2015b, 2015c), Imran et al. (2020), Iranmanesh and Zeraatkar (2010), Lin et al. (2014), Manzoor (2015), and Yang et al. (2019).

In this article, we derive the certain degree related molecular topological invariants for chemical networks like generalized Aztec diamonds, tetrahedral diamond lattice, and certain infinite classes of nanostar dendrimers. We compute the analytical formulas for above families of chemically applicable networks.

2 ABC, GA, ABC4, GA5, NM1, and NM2 indices of generalized Aztec diamonds

In this part of the article, we discuss the degree-based topological descriptors for the generalized Aztec diamonds.

For any two graphs W and F, the tensor product of the graphs W and F is interpreted by WF. The vertex set of WF is V(W) × V(F) and E(WF) = {(w, f)(s,e)|wsE(W) and feE(F)}.

The tensor product of two paths Lp and Lq is described by LpLq. It is a graph on p × q vertices with vertex set is defined as:

{ (x1,y1):1x1q,1y1p }

and an edge between the (x1, y1) and (x2, y2) exists if and only if:

| x1x2 || y1y2 |=1.

The graph LpLq is known as a generalized Aztec diamond with vertex cardinality pq. L9L10 is depicted in Figure 1. In the next theorem, the ABC index for generalized Aztec diamond graphs has been computed.

Figure 1 The partition of the edges of L9 ⊗ L10 that depend on the degree of every end vertex of each edge.
Figure 1

The partition of the edges of L9L10 that depend on the degree of every end vertex of each edge.

Theorem 2.1

The ABC index of generalized Aztec diamond graph G = LpLq for p, q ≥ 2, is:

ABC(LpLq)=62pq+(1334)22p+(1334)22q+2(3+262+964).

Proof

Firstly, we identify that the graph G has vertices having degree one, two, and four. Thus, the graph G has only edges with end vertices have degree one, two, or four. So possible edges are of type (1,4), (2,2), (2,4), and (4,4), where by edge of type (d(m). d(n)), we mean end vertices of the edge with degrees m and n. In Table 1, all the edges of type (1,4), (2,2), (2,4), and (4,4) are counted. Now, by appying the information shown in Table 1, the ABC index of LpLq is derived as:

ABC(G)=αβE(G)d(α)+d(β)2d(α)d(β).

ABC(LpLq)=41+421×4+42+222×2+4(p+q6)2+422×4+2(p3)(q3)4+424×4.

Table 1

The cardinality of edges of type (d(m), d(n)) of LpLq, where m and n are degrees of adjacent vertices of every edge

(d(m), d(n)) with mnE(G) Quantity of edges
(1,4) 4
(2,2) 4
(2,4) 4(p + q − 6)
(4,4) 2(p − 3)(q − 3)

After simplification of above calculations, we acquire the following result of ABC index:

ABC(LpLq)=62pq+(1334)22p+(1334)22q+2(3+262+964).

In Theorem 2.2, we have computed the GA invariant of generalized Aztec diamond.

Theorem 2.2

For

p,q2,GA(LpLq)=2pq+2(4233)p+2(4233)q+2(635623).

Proof

Again, by using the information given in Table 1, the GA invariant of generalized Aztec diamond is derived follows; since:

GA(G)=αβE(G)2d(α)d(β)(d(α)+d(β))

GA(LpLp)=4×21×41+4+4×22×22+2+4(p+q6)22×42+4+2(p3)(q3)24×44+4.

From an easy simplification, we acquired:

GA(LpLq)=2pq+2(4233)p+2(4233)q+2(635623).

Similarly, the ABC4 index of the generalized Aztec diamond can be computed by using Table 1.

Theorem 2.3

For p, q ≥ 2, the ABC4 index of LpLq is calculated as:

ABC4(LpLq)=308pq+(3+145308)p+(3+143304)q+(2113+2103+2303+223+683016+821031014).

Proof

In the ABC4 index, we first find possible degrees of all the vertices coneected to end vertices of each edge. An edge with sum of the degrees of end vertices is m and n, and is interpreted as (Sm, Sn) − type edges. Thus, the possible edges are of type type (4,9), (6,6), (9,8), (8,12), (12,16), (16,16), (6,12), (9,16), and (12,12). In Table 2, all the edges of type (4,9), (6,6), (9,8), (8,12), (12,16), (16,16), (6,12), (9,16), and (12,12) are counted. Now, by applying the information interpreted in Table 2, the ABC4 invariant of LpLq is computed as follows; since:

ABC4(G)=αβE(G)Sα+Sβ2SαSβ

Table 2

The cardinality of edges of type (Sm, Sn) of LpLq, where m and n are sum of degrees of all neighboring vertices of end vertices of each edge

(Sm, Sn) with mnE(G) Number of edges
(4, 9) 4
(6,6) 4
(6,12) 8
(8,12) 4(p + q − 10)
(9,8) 8
(9,16) 4
(12,12) 4
(12,16) 4(p + q − 10)
(16,16) 2 (p − 6)(q − 5) + 8

By an easy calculation, the above equation can be written as:

ABC4(LpLq)=308pq+(3+145308)p+(3+143304)q+(2113+2103+2303+2223+683016+821031014)

The following theorem gives the GA5 index of generalized Aztec diamond LpLq.

Theorem 2.4

For p, q ≥ 2, the GA5 index of generalized Aztec diamond G = LpLq

GA5(G)=2pq+2(265+2373)p+4(265+2373)q+4(2421746+2232037+6631325).

Proof

By applying the information given in Table 2 on Eq. 2, we get:

GA5(G)=uvE(G)2SuSvSu+Sv

GA5(LpLq)=24×94+9×4+26×66+6×4+29×89+8×8+28×128+12×4(p+q10)+26×126+12×4+216×1616+16[ 2(p6)(q5)+8 ]+212×1612+16×4(q+p10)+29×169+16×4+212×1212+12×4

After simplification, we get:

GA5(LpLq)=2pq+2(265+2373)p+4(265+2373)q+4(2421746+2232037+6631325).

Theorem 2.5

For p, q ≥ 2, the NM1 index of LpLq is calculated as:

NM1(LpLq)=256pq608p608q+6748.

Proof

In the NM1 index, we first find possible degrees sum of all the ertices. The possible degree sum of a vertex is either, 4 or 6 or 8 or 9 or 12. There are 4 vertices (red color in Figure 1) of degree sum is equal to 4. There are 8 vertices (green color in Figure 1) of degree sum is equal to 6. There are 2(p + q − 8) vertices (blue color in Figure 1) of degree sum is equal to 8 and 12. There are 4 vertices (blue color in Figure 1) of degree sum is equal to 9. There are (p − 4) (q − 4) vertices (black color in Figure 1) of degree sum is equal to 16. Now, by applying this information, the NM1 index of LpLq is computed as follows; since:

NM1(G)=vV(G)(Sv)2.

By an easy calculation, the above equation can be written as:

NM1(LpLq)=4(42)+8(62)+2(p+q8)(82)+4(92)+2(p+q8)(122)+(m4)(n4)(162)=256(p4)(q4)+416(p+q8)+676=256pq608p608q+6748

The following theorem gives the NM1 index of generalized Aztec diamond LpLq.

Theorem 2.6

For p, q ≥ 2, the NM2 index of LpLq is:

NM2(LpLq)=512pp1408p1408q+8144.

Proof

Since:

NM2(G)=uvE(G)SuSv.

Therefore, by applying this information given in Table 2, the NM2 index of LpLq is computed as follows:

NM2(G)=uvE(G)SuSv

NM2(LpLq)=(4×6)×4+(6×6)×4+(9×8)×8+(8×12)×4(p+q10)+(6×12)×4+(16×16)[ 2(p6)(q5)+8 ]+(12×16)×4(q+p10)+(9×16)×4+(12×12)×4.=512pp1408p1408q+8144.

3 ABC, GA, ABC4, GA5, NM1, and NM2 indices of tetrahedral diamond lattice

The structure of tetrahedral diamond lattice (Manuel et al., 2015) of t dimension is constructed by t layers, every one interpreted as lt. The starting layer has just a single vertex and the next one have 4 vertices, which is isomorphic to S4. For t ≥ 3, every layer l has k=1l2k hexagons with 3 pendent vertices. According to depth first labeling, we can construct every next layer for vertices. More precisely, we can use that layer l presented the labels form k=1l1k2 to k=1lk2 .

The vertex set of tetrahedral diamond of dimension t has k=1tk2 vertices and the edge set has 23(t2t) edges. There is no any odd cycle in Tetrahedral diamond, so it is a bipartite graph.

The tetrahedral diamond lattice of dimension t is constructed with the help of t-layers in the following ways. The vertex in the first(starting) layer with label 1 is connected with a vertex in layer 2 with label 3. The layers l and l + 1, l ≥ 2, are connected as:

  1. The vertex having label k=1l1k2+(m=1i2(lm))+(2f1)+1 in layer l is connected to the vertex which has label k=1lk2+2f in layer l +1 for all 1 ≤ f ≤ l.

  2. The vertex with label k=1l1k2+(m=1i2(lm))+(2f1)+1 in layer l is connected to the vertex which has label k=1lk2+(m=1i2(lm))+3+(2f) in layer l +1 where 1 ≤ il − 1 and 1 ≤ fli.

Figure 2 depicts a 5-dimension tetrahedral diamond.

Figure 2 The graph of 5-dimension tetrahedral diamond lattice.
Figure 2

The graph of 5-dimension tetrahedral diamond lattice.

In Theorem 3.1, the value of ABC4 invariant of tetrahedral diamond lattice is derived.

Theorem 3.1

For t ≥ 1, the ABC index of tetrahedral diamond lattice G with dimension t is:

ABC(G)=15t2+(62515)t+2(362+315)+k=5t(k4)(k3)6.

Proof

The graph G contains only vertices of degree one, two, three and four. The edges of the graph G of dimension t are of the form (1,4), (2,4), (3,4), and (4,4). The construction of graph indicates that the number of edges of tupe (1,4) are four for every layer. There are 6t–12 vertices of 2 degree, and two edges are induced by an each vertex. So, number of (2,4)-type edges is 12(t-2). Also by induction argument, the number of (3, 4)-type edges is:

9(t2)(t3)2+3(t2)(t3)2=6(t2)(t3).

Note that the quantity of (4,4)-type edges can be obtained by removing all edges of type (1,4), (2,4), (3,4) from G. Thus, the quantity of (4, 4)-type edges is:

| E(G) |((1,4)+(2,4)+(3,4))=23(t3t)(4+12t24+6t230t+36)=23(t39t2+26t24).

From Table 3, the formula for ABC index can be deduced to:

ABC(G)=41+421×4+12(t2)2+422×4+6(t2)(t3)3+423×4+23(t39t2+26t24)4+424×4.

Table 3

The quantity of (m, n)-type edges of tetrahedral diamond G, where m and n are degrees of the adjacent vertices of each edge

(d(m), d(n)) with mnE(G) Number of edges
(1,4) 4
(2,4) 12(t − 2)
(3,4) 6(t − 2)(t − 3)
(4,4) 23(t39t2+26t24)

After computation, we get:

ABC(G)=15t2+(62515)t+2(362+315)+k=5t(k4)(k3)6.

Theorem 3.2

The GA index of G (tetrahedral diamond lattice) of dimension t where t ≥ 1 is given by:

GA(G)=24t2+4(223037)t+16(15+9372)+2k=5t(k4)(k3).

Proof

The GA index formula of tetrahedral diamond lattice G is deduced by using the information from Table 3 as:

GA(G)=21×41+4×4+22×42+4×12(t2)+23×43+4×6(t2)(t3)+24×44+4×2k=5t(k4)(k3)

After an easy computation, we acquire:

GA(G)=24t2+4(223037)t+16(15+9372)+2k=5t(k4)(k3).

Now we shall calculate the ABC4 and GA5 index for tetrahedral diamond lattice G in upcoming theorems.

Theorem 3.3

The result for ABC4 index of tetrahedral diamond lattice G is:

ABC4(G)=(241020652329)t+(46+2329)t2+3(86+17+21314+22329)+k=5n(k4)(k3)9239.

Proof

Let Sm denote the sum of degrees of all the vertices joined with vertex m. The (Sm, Sn )- type edges are the edges with sum of degrees of neighboring vertices of the end vertices of every edge is Sm and Sn. The formula for ABC4 index of tetrahedral diamond lattice G can be deduced by applying the edge partition of Table 4 and written as:

ABC4(G)=44+724×7+127+827×8+12(t3)8+1028×10+4(t2)(t3)12+10212×10+2(t2)(t3)12+13212×13+2k=5t(k4)(k3)16+13216×13.

After simplification, we acquire:

ABC4(G)=(241020652329)t+(46+2329)t2+3(86+17+21314+22329)+k=5t(k4)(k3)9239.

Table 4

The quantity of (Sm, Sn)-type edges, where m and n are sum of degrees of all neighboring vertices of the end vertices of each edge

(Sm, Sn) with mnE(G) Number of edges
(4,7) 4
(7,8) 12
(8,10) 12(t − 3)
(12,10) 4(t − 2)(t − 3)
(12,13) 2(t − 2)(t − 3)
(16,13) 2k=5t(k4)(k3)

In upcoming theorem, we compute the ABC4 index for tetrahedral diamond lattice.

Theorem 3.4

The GA5 index for the tetrahedral diamond lattice G is given by:

(5) GA5(G)=4(203103011)t+8(3011+3925)t2+4(4711+12141520+123011+123925)+161329k=5t(k4)(k3)

Proof

By applying the information from Table 4 in Eq. 5, we derive the GA5 index as:

GA5(G)=24×74+7×4+28×78+7×12+28×1010+812(t3)+212×1012+10×4(t2)(t3)+212×1312+13×2(t2)(t3)+216×1316+13×2k=5t(k4)(k3),

which can be deduced to:

GA5(G)=4(203103011)t+8(3011+3925)t2+4(4711+12141520+123011+123925)+161329k=5t(k4)(k3).

Theorem 3.5

The result for NM1 index of tetrahedral diamond lattice G is:

NM1(G)85t3552t2+2410t2047.

Proof

Let Sm denote the sum of degrees of all the vertices joined with vertex m. The degree sum of the vertex in the graph is either 4 or 7 or 8 or 10 or 12 or 16. The computation gives that:

S4=4,S7=4,S8=6t12,S10=6t18,S12=(t2)(3t5)2,S16=(t2(t3)(t4)3.

Using this information NM1 index of tetrahedral diamond lattice G can be calculated as follows:

NM1(G)=vV(G)(Sv)2=4(42)+4(72)+(6t12)(82)+(6t18)(102)+(t2)(3t5)2(122)+(t2)(t3)(t4)3(162)85t3552t2+2410t2047.

In upcoming theorem, we compute the GA5 index for tetrahedral diamond lattice.

Theorem 3.6

The NM2 index for the tetrahedral diamond lattice G is given by:

NM2(G)=792t23000t+2656+416k=5t(k4)(k3).

Proof

By applying the information from Table 4 in Eq. 5, we derive the GA5 index as:

NM2(G)=uvE(G)SuSv=(4×7)×4+(8×7)×12+(8×10)12(t3)+(12×10)×4(t2)(t3)+(12×13)×2(t2)(t3)+(16×13)×2k=5t(k4)(k3)=792t23000t+2656+416k=5t(k4)(k3)

4 Conclusion

In this article, some degree depended invariants namely ABC, GA, ABC4, GA5, NM1, and NM2 indices are computed for the networks constructed from generalized Aztec diamonds and tetrahedral diamond lattices. We have found the exact values of these parameters for the said classes of graphs. This, we believe will work in the favour of researcher working in network science to investigate the underlying topologies of given networks.

In future, it is interesting to design certain new networks and then investigate their topological properties and compute their exact values which can be fruitful in understanding of the underlying topologies.

Acknowledgement

The authors are very grateful to the referees for their constructive suggestions and useful comments, which improved this work very much.

  1. Research funding:

    This research is supported by the the UPAR Grant of United Arab Emirates University (UAEU), Al Ain, United Arab Emirates via Grant No. G00002590 and UPAR Grant of UAEU via Grant No. G00003271.

  2. Author contributions:

    Syed Ahtsham Ul Haq Bokhary: writing – original draft, writing – review and editing, methodology, formal analysis; Muhammad Imran: writing – original draft, writing – review and editing, visualization, project administration, funding acquisition; Shehnaz Akhter: writing – original draft, investigation, resources; Sadia Manzoor: writing – original draft, data collection.

  3. Conflict of interest:

    One of the authors (Muhammad Imran) is a Guest Editor of the Main Group Metal Chemistry's Special Issue “Topological descriptors of chemical networks: Theoretical studies” in which this article is published.

  4. Data availability statement:

    The data used to support the findings of this study are included within the article.

References

Ahmad U., Sarfraz A., Yousaf R., Computation of Zagreb and Atom bond connectivity Indices of Certain Families of Dendrimers by using Automorphism. J. Serbian Chemical Soc., 2017, 82, 151–162.10.2298/JSC160718096ASearch in Google Scholar

Alikhani S., Hasni R., Arif N.E., On the atom-bond connectivity index of some families of dendrimers. J. Comput. Theor. Nanosci., 2014, 11, 1802–1805.10.1166/jctn.2014.3570Search in Google Scholar

Akhter S., Imran M., On degree-based topological descriptors of strong product graphs. Can. J. Chem., 2016a, 94(6), 559–565.10.1139/cjc-2015-0562Search in Google Scholar

Akhter S., Imran M., On molecular topological properties of benzenoid structures. Can. J. Chem., 2016b, 94(8), 687–698.10.1139/cjc-2016-0032Search in Google Scholar

Akhter S., Imran M., Gao W., Frahani M.R., On topological indices of honeycomb networks and Graphene networks. Hac. J. Math. Stat., 2018, 47(1), 1–17.10.15672/HJMS.2017.464Search in Google Scholar

Akhter S., Imran M., Farahani M.R., Javaid I., On topological properties of hexagonal and silicate networks. Hac. J. Math. Stat., 2019, 48(3), 711–723.10.15672/HJMS.2017.541Search in Google Scholar

Bača M., Horváthová J., Mokrišová M., Suhányiová A., On topological indices of Fullerenes. Appl. Math. Comput., 2015, 251, 154–161.10.1016/j.amc.2014.11.069Search in Google Scholar

Baig A.Q., Imran M., Ali H., Computing Omega, Sadhana and PI polynomials of benezoid carbon nanotubes. Optoelectron. Adv. Mater. Rapid Communin., 2015a, 9, 248–255.Search in Google Scholar

Baig A.Q., Imran M., Ali H., On topological indices of poly oxide, poly silicate, DOX and DSL networks. Canad. J. Chem., 2015b, 93, 730–739.10.1139/cjc-2014-0490Search in Google Scholar

Diudea M.V., Gutman I., Lorentz J., Molecular Topology. Nova, Huntington, 2001.Search in Google Scholar

Estrada E., Torres L., Rodríguez L., Gutman I., An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes. Indian J. Chem. 1998, 37A, 849–855.Search in Google Scholar

Ghorbani M., Hosseinzadeh M.A., Computing ABC4 index of nanostar dendrimers. Optoelectron. Adv. Mater. Rapid Commun., 2010, 4, 1419–1422.Search in Google Scholar

Graovac A., Ghorbani M., Hosseinzadeh M.A., Computing fifth geometric-arithmetic index for nanostar dendrimers. J. Math. Nanosci., 2011, 1, 33–42.Search in Google Scholar

Gutman I., Polansky O.E., Mathematical concepts in organic chemistry. Springer-Verlag, New York, 1986.10.1007/978-3-642-70982-1Search in Google Scholar

Guirao J.L.G., Imran M., Siddiqui M.K., Akhter S., On valency-based molecular topological descriptors of subdivision vertex-edge join of three graphs. Symmetry, 2020, 12, 1026.10.3390/sym12061026Search in Google Scholar

Hameed S., Ahmad U., Extremal values in a class of basic peri-condensed benzenoids with respect to VDB topological indices. Ars Combinatoria, 2019, 145, 367–376.Search in Google Scholar

Hayat S., Imran M., Computation of topological indices of certain networks. Appl. Math. Comput., 2014, 240, 213–228.10.1016/j.amc.2014.04.091Search in Google Scholar

Hayat S., Imran M., Computation of certain topological indices of nanotubes. J. Comput. Theor. Nanosci., 2015a, 12, 70–76.10.1166/jctn.2015.3699Search in Google Scholar

Hayat S., Imran M., Computation of certain topological indices of nanotubes covered by C5 and C7. J. Comput. Theor. Nanosci., 2015b, 12, 533–541.10.1166/jctn.2015.3761Search in Google Scholar

Hayat S., Imran M., On some degree based topological indices of certain nanotubes. J. Comput. Theor. Nanosci., 2015c, 12, 1599–1605.10.1166/jctn.2015.3935Search in Google Scholar

Imran M., Akhter S., Iqbal Z., Edge Mostar index of chemical structures and nanostructures using graph operations. Int. J. Quantum. Chem., 2020, 120, e26259.10.1002/qua.26259Search in Google Scholar

Iranmanesh A., Zeraatkar M., Computing GA index for some nanotubes. Optoelectron. Adv. Mater. Rapid Commun., 2010, 4, 1852–1855.Search in Google Scholar

Lin W., Chen J., Chen Q., Gao T., Lin X., Cai B., Fast computer search for trees with minimal ABC index based on tree degree sequences. MATCH Commun. Math. Comput. Chem., 2014, 72, 699–708.Search in Google Scholar

Manzoor S., On Topological Indices of Certain Networks. M. Phill Dissertation, submitted to Higher Education Commission, Pakistan, 2015.Search in Google Scholar

Manuel P.D., Rajan B., Grigorious C., Stephen S., On the strong metric dimension of tetrahedral diamond lattice. Math. Comput. Sci., 2015, 9, 201–208.10.1007/s11786-015-0226-0Search in Google Scholar

Reti T., Ali A., Varga P., Bitay E., Some properties of the neighborhood first Zagreb index. Discrete Math. Lett., 2019, 2, 10–17.Search in Google Scholar

Vukičević D., Furtula B., Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J. Math. Chem., 2009, 46, 1369–1376.10.1007/s10910-009-9520-xSearch in Google Scholar

Wiener H., Structural determination of paraffin boiling points. J. Amer. Chem. Soc., 1947, 69, 17–20.10.1021/ja01193a005Search in Google Scholar PubMed

Yang H., Imran M., Akhter S., Iqbal Z., Siddiqui M.K., On distance-based topological descriptors of subdivision vertex-edge join of three graphs. IEEE Access, 2019, 7, 143381–143391.10.1109/ACCESS.2019.2944860Search in Google Scholar

Received: 2020-08-19
Accepted: 2021-01-03
Published Online: 2021-06-07

© 2021 Syed Ahtsham Ul Haq Bokhary et al., published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 25.4.2024 from https://www.degruyter.com/document/doi/10.1515/mgmc-2021-0010/html
Scroll to top button