Topological invariants for the line graphs of some classes of graphs

Xiaoqing Zhou; Mustafa Habib; Tariq Javeed Zia; Asim Naseem; Anila Hanif; Ansheng Ye

doi:10.1515/chem-2019-0154

Artikel Open Access

Topological invariants for the line graphs of some classes of graphs

Xiaoqing Zhou , Mustafa Habib , Tariq Javeed Zia , Asim Naseem , Anila Hanif und Ansheng Ye

Veröffentlicht/Copyright: 31. Dezember 2019

Veröffentlicht von

Veröffentlichen auch Sie bei De Gruyter Brill

Manuskript einreichen Informationen für Autor*innen Erkunden Sie dieses Fachgebiet

Aus der Zeitschrift Open Chemistry Band 17 Heft 1

Abstract

Graph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics. A topological index (TI) is a real number attached to graph networks and correlates the chemical networks with physical and chemical properties, as well as with chemical reactivity. In this paper, our aim is to compute degree-dependent TIs for the line graph of the Wheel and Ladder graphs. To perform these computations, we first computed M-polynomials and then from the M-polynomials we recovered nine degree-dependent TIs for the line graph of the Wheel and Ladder graphs.

Keywords: line graph; topological index; M-polynomial

1 Introduction

In mathematical chemistry, we use mathematics to solve problems of chemistry, and a key area of research in mathematical chemistry is Chemical graph theory in which we represent compounds and chemical structures with graphs and apply graph theory to study their topologies. Topological indices (TIs) are real numbers attached to graph networks and graph of compounds.

TIs remain invariant and can be used in predicting the properties of interesting compounds [1].

In the field of heminformatics, quantitative structure-activity relationship (QSAR) and quantitative structure-property relationship (QSPR), together with Tis, are utilized to study properties and chemical bioactivity of compounds [2]. Like TIs, polynomials also support a considerable number of applications in network theory and chemistry; for instance, the Hosoya polynomial, which is also known as Wiener polynomial [3], is helpful in constructing distance-dependent TIs. The M-polynomial was introduced previously [4] for deciding degree-dependent TIs [5,6].

Definition 1. For a simple connected graph G, the M-polynomial is defined in [4] as:

M(G;x,y)=∑δ≤i≤j≤Δmij(G)xiyj,

where δ=Min{dv:v∈V(G)},Δ=Max{dv:v∈V(G)},and m_ij (G) is the edge vu∈ E(G) such that {d_v , d_u} = {i, j}.

The Wiener polynomial was the first such function, with the Wiener index being introduced in 1947 [7]. Thus, we can say that Harold Wiener began the theory of TIs [8,9]. After Wiener’s work, Milan Randic [10] introduced the first degree-dependent TI, which is today known as Randic index (RI), in 1975. The mathematical formula of RI is

R−1/2(G)=∑uv∈E(G)1dudv.

In 1988, a generalized version of RI was defined by several researchers [11,12]. This version attracted the attention of both mathematicians and chemists [13]. Numerous numerical properties of this simple TI have studied, and results are presented in research reports [14] and a helpful book [15]. In addition, many research papers and books [16, 17, 18] have been published regarding RI. Two reviews of RI were written by Randic [19,20] and three more reviews have been written on this TI by other scientists [21, 22, 23].

After RI, the most interesting TIs are 1^st Zagreb index (ZI) and 2^nd ZI [24, 25, 26, 27]. The first and second ZIs were proposed by Gutman and Trinajstic’ and are defined as

M1(G)=∑uv∈E(G)(du+dv)

and

M2(G)=∑uv∈E(G)(du×dv)

The modified 2^nd ZI was defined in [28] as

mM2(G)=∑uv∈E(G)1d(u)d(v).

Other TIs include symmetric division (SDI) [29]

SDD(G)=∑uv∈E(G){min(du,dv)max(du,dv)+max(du,dv)min(du,dv)}

harmonic index (HI) [30,31]

H(G)=∑vu∈E(G)2du+dv

inverse sum index

I(G)=∑vu∈E(G)dudvdu+dv

and augmented ZI [32]

A(G)=∑vu∈E(G){dudvdu+dv−2}3.

In the remaining paper, we consider G to be the simple connected graph. A graph G with vertex set V(G) and edge set E(G) is connected if there exists a connection between any pair of vertices in G [33]. The quantity of vertices of G adjoining a given vertex v, is the “degree” of this vertex and will be denoted by d^v. Throughout this paper, G will represent a connected graph, V its vertex set, E its edge set, and d_v the degree of its vertex v. The line graph of G is denoted by L(G) and is obtained from G by associating a vertex with each edge of the graph and connecting two vertices with an edge if and only if the corresponding edges of G have a vertex in common.

In this paper we study line graph of Wheel and Ladder graphs. We computed several degree-based topological indices of the understudy families of graphs.

2 Methodology

There are three kinds of TIs:

Degree-based TIs
Distance-based TIs
Spectral-based TIs

In this paper, we aim to compute degree-dependent TIs. To compute degree-based TIs of line graph of Wheel, Ladder and Bipartite graphs, we first drew line graphs and then we divided the edge sets of these line graphs into classes based on the degree of the end vertices and computed their cardinality. From this edge partition, we computed our desired results. First, we computed M-polynomials of the understudy families of graphs. Then, by applying calculus and using table 1, we computed several TIs.

Table 1

Derivation of TIs from M-Polynomial.

Topological Index	Derivation from M(G; x, y)
M₁	(D_x + D_y )(M(G; x, y))_x_{= y=1}
M₂	(D_xD_y )(M(G; x, y))_x_{= y=1}
^mM₂	(S_xS_y )(M(G; x, y))_x_{= y=1}
Ra	(DxαDyα)(M(G; x, y))_x_{= y = 1}
RRα	(SxαSyα)(M(G; x, y))_x_{= y = 1}
SSD	(D_xS_y + S_xD_y )(M(G; x, y))_x_{= y=1}
H	2S_x J (M(G; x, y))_x₌₁
I	S_x JD_xD_y (M(G; x, y))_x_{= 1}
A	Sx3Q−2JDx3Dy3(M(G;x,y))x=1

The relationship between M-polynomial and indices is presented in table 1 [4] where

Dx=x∂(f(x,y)∂x,Dy=y∂(f(x,y)∂y,

Sx=∫0xf(t,y)tdt,Sy=∫0yf(x,t)tdt,J(f(x,y))=f(x,x),

Qα(f(x,y))=xαf(x,y).

2.1 Main Results

This section consists of two subsections. In the first subsection we study the line graph of the Wheel graph, and in the second subsection we study the line graph of the ladder graph.

2.2 M-polynomial of line graph of Wheel Graph

In order to construct a wheel graph, we connected a single vertex to other vertices in a cycle. A wheel graph with n vertices can also be defined as the 1-skeleton of an (n-1)- gonal pyramid. The Wheel graph is given in Figure 1 and its line graph is given in Figure 2.

Figure 1

Wheel graph.

Figure 2

Line graph of Wheel graph.

2.2.1 Theorem 1

Assume G to be the line graph of Wheel graph; then, we have

M(G,x,y)=nx4y4+n(n+1)2xn+1yn+1+2nx4yn+1.

2.2.2 Proof

The line graph of Wheel graph is shown in Figure 2. From Figure 2, we have

|V(G)|=2n,

|E(G)|=n(n+5)2.

We can divide the vertex set of G into the following two types, depending on the degree

V1(G)={v∈V(G):dv=4},

V2(G)={v∈V(G):dv=n+1},

Such that

|V1(G)|=n,

|V2(G)|=n.

We can divide the edge set of G into the following three classes depending on each edge at the degree of end vertices:

E1(G)={uv∈E(G);du=4 and dv=4},

E2(G)={uv∈E(G);du=n+1 and dv=n+1},

and

E3G=uv∈EG;du=4 and dv=n+1.

Now

|E1(G)|=n,

|E2(G)|=n(n−1)2,

|E3(G)|=2n.

From definition

M(G,x,y)=∑δ≤i≤j≤Δmijxiyj =∑uv∈E1(G)m44x4y4+∑uv∈E2(G)mn+1,n+1xn+1yn+1+∑uv∈E3(G)m4,n+1x4yn+1 =nx4y4+n(n+1)2xn+1yn+1+2nx4yn+1.

2.2.3 Proposition 2

Let G be the line graph of Wheel graph; then we have

M1(G)=n3+2n2+13nM2(G)=4n2+(2n2−2n)(n+1)2+12nmM2(G)=n16+n(n2−n)(n+1)2+n(2n+2)SSD(G)=5n3+6n2+17n2(n+1)H(G)=n4+(n2−n)(n+1)+4n(n+5)I(G)=2n+(n3−n2+8(n2+n)(n+5))A(G)=4663nx6+n(n+1)3(n+1)24n3x2n+25n(n+1)(n+3)3xn+3

2.2.4 Proof

Let

f(x,y)=M(G,x,y)=nx4y4+n(n+1)2xn+1yn+1+2nx4yn+1.

Then

Dxf(x,y)=4nx4y4+(n+1)n(n+1)2xn+1yn+1+8nx4yn+1,

Dyf(x,y)=4nx4y4+n(n+1)22xn+1yn+1+2n(n+1)x4yn+1,

DyDxf(x,y)=16nx4y4+(n+1)2(n2+n)2xn+1yn+1+(8n2+8n)x4yn+1,

Sy(f(x,y))=n4x4y4+n2xn+1yn+1+2nn+1x4yn+1,

SxSy(f(x,y))=n16x4y4+n(2n+2)xn+1yn+1+n2(n+1)x4yn+1,S

DxαDyα(f(x,y))=42αnx4y4+n(n+1)2α+12xn+1yn+1+2n4α(n+1)αx4yn+1,

SyDx(f(x,y))=nx4y4+n(n+1)2xn+1yn+1+8nn+1x4yn+1,

SxDy(f(x,y))=nx4y4+n(n+1)2xn+1yn+1+(n2+1)2x4yn+1,

SxJf(x,y)=n8x8+n4x2n+2+2nn+5xn+5,

SxJDxDyf(x,y)=2nx8+n(n+1)24x2n+2+8n(n+1)n+5xn+5,

Sx3Q−2JDx3Dy3f(x,y)=4663nx6+n(n+1)72(2n)3x2n+2n43(n+1)3(n+3)3xn+3,

First Zagreb index
M1(G)=Dx+Dy(f(x,y)) =n3+2n2+13n.
Second Zagreb index
M2(G)=DxDy(f(x,y)) =4n2+(2n2−2n)(n+1)2+12n.
Modified Second Zagreb index
mM2(G)=SxSy(f(x,y)) =n16+n(n2−n)(n+1)2+n(2n+2).S
Symmetric Division index
SSD(G)=(SyDx+SxDy)(f(x,y))| =5n3+6n2+17n2(n+1).
Harmonic index
H(G)=2SxJ(f(x,y))|x=1 =n4+(n2−n)(n+1)+4n(n+5).
Inverse Sum index
IG=SxJDxDyfx,yx=1=2n+n3−n2+8n2+nn+5.
Augmented Zagreb index
A(G)=Sx3Q−2JDx3Dy3(f(x,y))|x=1 =4663+n(n+1)3(n−1)24n3+25n(n+1)(n+3)3.

2.3 M-polynomial of the line graph of the Ladder Graph

A Ladder graph is a planar undirected graph with 2n vertices and 3n-2 edges. The ladder graph can be obtained as the Cartesian product of two path graphs, one of which has only one edge. In this section, let G denote the line Graph of Ladder Graph. The line graph of ladder graph is given in Figure 3.

Figure 3

Line graph of ladder graph.

2.3.1 Theorem 3

Let G be the line graph of Ladder graph. Then we have

M(G,x,y)={4x2y3+2x3y3+4x3y4, if n=24x2y3+8x3y4+(6n−14)x4y4, if n>2.

2.3.2 Proof

Case 1 when n=2

We can divide the edge set of the line graph of ladder graph into following three classes depending on each edge at the end vertices of the degree

E1(G)={e=uv∈E(G);du=2 and dv=3},

E2G=e=uv∈EG;du=3and dv=3,

E3G=e=uv∈EG;du=3and dv=4.

Now

|E1(G)|=4,

|E2(G)|=2,

|E3(G)|=4,

So by definition of M-polynomial, we have

M(G,x,y)=|E1(G)|x2y3+|E2(G)|x3y3+|E3(G)|x3y4 =4x2y3+2x3y3+4x3y4.

Case 2 when n>2

We can divide the edge set of the line graph of ladder graph into following three classes depending on the degree of end vertices of each edge:

E1(G)={e=uv∈E(G);du=2,dv=3},

E2(G)={e=uv∈E(G);du=3,dv=4},

and

E3(G)={e=uv∈E(G);du=dv=4}.

Now

|E1(G)|=4,

|E2(G)|=8,

|E3(G)|=6n−14.

From the definition of M-polynomial, we have

M(G,x,y)=∑δ≤i≤j≤Δmijxiyi =∑uv∈E1(G)m23x2y3+∑uv∈E2(G)m34x3y4+∑uv∈E1(G)m44x4y4 =|E1(G)|x2y3+|E2(G)|x3y4+|E3(G)|x4y4 =4x2y3+8x3y4+(6n−14)x4y4.

2.3.3 Proposition 2

Let G be the line graph of Ladder graph. Then we have

1. M1(G)={60if n=252+5(6n−14),if n>2.

2.M2G=90if n=296n−128if n>2.

3. mM2(G)={119if n=26n+5048if n>2.

4. SSD(G)={21if n=248+5(6n−14)4if n>2.

5.HG=318105ifn=254−210n140ifn>2.

6. I(G)={51335if n=2420n−63235if n>2.

7. A(G)={8806188000if n=24064512+307200027000if n>2.

2.3.4 Proof

Let

f(x,y)=M(G,x,y)={4x2y3+2x3y3+4x3y4,if n=24x2y3+8x3y4+(6n−14)x4y4,if n>2.

Then

Dxf(x,y)={8x2y3+6x3y3+12x3y4,if n=28x2y3+8x3y4+(6n−14)x4y4,if n>2.

First Zagreb index
M1(G)=Dx+Dy(f(x,y))={60if n=252+5(6n−14),if n>2.
Second Zagreb index
M2(G)=Dx+Dy(f(x,y))={90if n=296n−128if n>2.
Modified Second Zagreb index
mM2(G)=SxSy(f(x,y))={119if n=26n+5048if n>2.
Symmetric Division index
SSD(G)=(SyDx+SxDy)(f(x,y))| ={21if n=248+5(6n−14)4if n>2.
Harmonic index
HG=2SxJfx,yx=1=318105if n=254−210n140if n>2.
Inverse Sum index
I(G)=SxJDxDy(f(x,y))x=1={51335if n=2420n−63235if n>2.
Augmented Zagreb index
A(G)=Sx3Q−2JDx3Dy3(f(x,y))|x=1 ={8806188000if n=24064512+307200027000if n>2.

3 Conclusions

TIs are numbers associated with the molecular graphs of chemical structures that are useful in predicting properties of chemical compounds of interest [33, 34, 35, 36, 37, 38, 39]. TIs and QSARs together are used in chemistry, and they tell us about the topology of compounds under study. Calculating TIs of molecular graphs of chemical structures is an interesting problem and has attracted many researchers in recent years. In this paper, we computed M-polynomials for the line graph of some interesting families of graphs. We also computed different TIs from the computed M-polynomials by applying fundamental results of Calculus. We computed Zagreb indices, Randic indices, Symmetric division index, inverse sum index, etc. Our results are applicable in predicting properties of compounds. For example, the symmetric division index is a good predictor of the total surface area, Zagreb indices are used to calculate total pi-electronic energy, the inverse sum index is helpful in approximation of total surface area, augmented Zagreb index is a good predictor of the heat of formation, and the harmonic index is used for medication configuration.

Conflict of interest: Authors declare no conflict of interest.

References

[1] Gao W., Wang W. F., Dimitrov D., Wang Y. Q., Nano properties analysis via fourth multiplicative ABC indicator calculating, Arabian Journal of Chemistry, 2018, 11(6), 793-801.10.1016/j.arabjc.2017.12.024Suche in Google Scholar

[2] Naeem M., Siddiqui M. K., Guirao J.L.G., Gao W., New and Modified Eccentric Indices of Octagonal Grid Omn, Applied Mathematics and Nonlinear Sciences, 2018, 3(1), 209-228.10.21042/AMNS.2018.1.00016Suche in Google Scholar

[3] Gutman I., Some properties of the Wiener polynomials, Graph Theory Notes New York, 1993, 125, 13–18.Suche in Google Scholar

[4] Deutsch E., Klavzar S., M-Polynomial, and degree-based topological indices, Iran. J. Math. Chem., 2015, 6, 93–102.Suche in Google Scholar

[5] Riaz M., Gao W., Baig A.Q., M-Polynomials and degree-based Topological Indices of Some Families of Convex Polytopes, Open j. math. sci., 2018, 2(1), 18–28.10.30538/oms2018.0014Suche in Google Scholar

[6] Munir M., Nazeer W., Shahzadi S., Kang S.M., Some invariants of circulant graphs, Symmetry, 2016, 8(11), 134, 10.3390/ sym8110134.10.3390/sym8110134Suche in Google Scholar

[7] Wiener H., Structural determination of paraffin boiling points, J. Am. Chem. Soc., 1947, 69, 17–20.10.1021/ja01193a005Suche in Google Scholar

[8] Dobrynin A.A., Entringer R., Gutman I., Wiener index of trees: theory and applications, Acta Appl. Math., 2001, 66, 211–249.10.1023/A:1010767517079Suche in Google Scholar

[9] Anjum M.S., Safdar M.U., K Banhatti and K hyper-Banhatti indices of nanotubes, Eng. Appl. Sci. Lett., 2019, 2(1), 19 – 37.10.30538/psrp-easl2019.0013Suche in Google Scholar

[10] Randic M., On the characterization of molecular branching, J. Am. Chem. Soc., 1975, 97, 6609– 6615.10.1021/ja00856a001Suche in Google Scholar

[11] Bollobas B., Erdos P., Graphs of extremal weights, Ars. Combin., 1998, 50, 225–233.10.1016/S0012-365X(98)00320-3Suche in Google Scholar

[12] Amic D., Beslo D., Lucic B., Nikolic S., Trinajstic´ N., The Vertex-Connectivity Index Revisited, J. Chem. Inf. Comput. Sci., 1998, 38, 819–822.10.1021/ci980039bSuche in Google Scholar

[13] Hu Y., Li X., Shi Y., Xu T., Gutman I., On molecular graphs with smallest and greatest zeroth-Corder general randic index, MATCH Commun. MatAh. Comput. Chem., 2005, 54, 425–434.Suche in Google Scholar

[14] Caporossi G., Gutman I., Hansen P., Pavlovic L., Graphs with maximum connectivity index, Comput. Biol. Chem., 2003, 27, 85–90.10.1016/S0097-8485(02)00016-5Suche in Google Scholar

[15] Shao Z., Virk A.R., Javed M.S., Rehman M.A., Farahani M. R., Degree based graph invariants for the molecular graph of Bismuth Tri-Iodide, Eng. Appl. Sci. Lett., 2019, 2(1), 01–11.10.30538/psrp-easl2019.0011Suche in Google Scholar

[16] Virk A. R., Jhangeer M.N., Rehman M.A., Reverse Zagreb and Reverse Hyper-Zagreb Indices for Silicon Carbide Si₂C₃-I [r,s] and Si₂C₃-II [r,s], Eng. Appl. Sci. Lett., 2018, 1(2), 37-50.Kier L. B.,10.30538/psrp-easl2018.0010Suche in Google Scholar

[17] De N., Computing Reformulated First Zagreb Index of Some Chemical Graphs as an Application of Generalized Hierarchical Product of Graphs, Open j. math. sci., 2018, 2(1), 338–350.10.30538/oms2018.0039Suche in Google Scholar

[18] Yan L., Farahani M.R., Gao W., Distance-based Indices Computation of Symmetry Molecular Structures, Open j. math. sci., 2018, 2(1), 323–337.10.30538/oms2018.0038Suche in Google Scholar

[19] Randić M., On History of the Randić Index and Emerging Hostility toward Chemical Graph Theory, MATCH Commun. Math. Comput. Chem., 2008, 59, 5-124.Suche in Google Scholar

[20] Randić M., The Connectivity Index 25 Years After, J. Mol. Graphics Modell. 2001, 20, 19–35.10.1016/S1093-3263(01)00098-5Suche in Google Scholar

[21] Imran M., Asghar A., Baig A.Q., On Graph Invariants of Oxide Network, Eng. Appl. Sci. Lett., 2018, 1(1), 23–28.10.30538/psrp-easl2018.0004Suche in Google Scholar

[22] Li X., Shi Y., A survey on the Randic index, MATCH Commun. Math. Comput. Chem., 2008, 59, 127–156.Suche in Google Scholar

[23] Gao W., Asghar A., Nazeer W., Computing Degree-Based Topological Indices of Jahangir Graph, Eng. Appl. Sci. Lett., 2018, 1(1), 16–22.10.30538/psrp-easl2018.0003Suche in Google Scholar

[24] Nikolić S., Kovačević G., Miličević A., Trinajstić N., The Zagreb indices 30 years after, Croat. Chem. Acta, 2003, 76, 113-124.Suche in Google Scholar

[25] Gutman I., Das K.C., The first Zagreb indices 30 years after, MATCH Commun. Math. Comput. Chem., 2004, 50, 83–92.Suche in Google Scholar

[26] Das K., Gutman I., Some Properties of the Second Zagreb Index, MATCH Commun. Math. Comput. Chem., 2004, 52, 103–112.Suche in Google Scholar

[27] Vukiˇcevi´c D., Graovac A., Valence connectivities versus Randic, Zagreb and modified Zagreb index: A linear algorithm to check discriminative properties of indices in acyclic molecular graphs, Croat. Chem. Acta., 2004, 77, 501–508.Suche in Google Scholar

[28] Milicevic A., Nikolic S., Trinajstic N., On reformulated Zagreb indices, Mol. Divers., 2004, 8, 393–399.10.1023/B:MODI.0000047504.14261.2aSuche in Google Scholar

[29] Gupta C.K., Lokesha V., Shwetha S.B., Ranjini P.S., On the Symmetric Division deg Index of Graph, Southeast Asian Bulletin of Mathematics, 2016, 40(1), 59-80.Suche in Google Scholar

[30] Favaron O., Mahéo M., Saclé J.F., Some eigenvalue properties in graphs (conjectures of Graffiti—II), Discrete Math.,1993, 111, 197–220.10.1016/0012-365X(93)90156-NSuche in Google Scholar

[31] Balaban A. T., Highly discriminating distance based numerical descriptor, Chem. Phys. Lett., 1982, 89, 399–404.10.1016/0009-2614(82)80009-2Suche in Google Scholar

[32] Furtula B., Graovac A., Vukiˇcevi´c D., Augmented Zagreb index, J. Math. Chem., 2010, 48, 370–380.10.1007/s10910-010-9677-3Suche in Google Scholar

[33] Ali A., Nazeer W., Munir M., et al., M-Polynomials And Topological Indices Of Zigzag And Rhombic Benzenoid Systems. Open Chemistry, 2018, 16(1), 73-78, doi:10.1515/chem-2018-0010.10.1515/chem-2018-0010Suche in Google Scholar

[34] Kanabur R., Hosamani S.K., Some Numerical Invariants Associated with V-phenylenic Nanotube and Nanotori, Eng. Appl. Sci. Lett., 2018, 1(1), 1-9.10.30538/psrp-easl2018.0001Suche in Google Scholar

[35] Gao W., Asif M., Nazeer W., The study of honeycomb derived network via topological indices, Open j. math. anal., 2018, 2(2), 10–26.10.30538/psrp-oma2018.0014Suche in Google Scholar

[36] Noreen S., Mahmood A., Zagreb polynomials and redefined Zagreb indices for the line graph of carbon nanocones, Open j. math. anal., 2018, 2(1), 66–73.10.30538/psrp-oma2018.0012Suche in Google Scholar

[37] De N., Hyper Zagreb Index of Bridge and Chain Graphs, Open j. math. sci., 2018, 2(1), 1-17.10.30538/oms2018.0013Suche in Google Scholar

[38] Siddiqui H., Farahani M.R., Forgotten polynomial and forgotten index of certain interconnection networks, Open j. math. anal., 2017, 1(1), 44–59.10.30538/psrp-oma2017.0005Suche in Google Scholar

[39] Ur Rehman H.M., Sardar R., Raza A., Computing topological indices of Hex Board and its line graph, Open j. math. sci., 2017, 1(1), 62–71.10.30538/oms2017.0007Suche in Google Scholar

[40] Sardar M.S., Zafar S., Farahani M.R., The Generalized Zagreb Index of Capra-Designed Planar Benzenoid Series Ca_k (C₆ Open j. math. sci., 2017, 1(1), 44–51.10.30538/oms2017.0005Suche in Google Scholar

Received: 2019-03-05

Accepted: 2019-07-01

Published Online: 2019-12-31

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

Artikel in diesem Heft

https://doi.org/10.1515/chem-2019-0154

Schlagwörter für diesen Artikel

line graph; topological index; M-polynomial

Creative Commons

BY 4.0