Loading [MathJax]/jax/output/SVG/jax.js
Research article

Topological indices of linear crossed phenylenes with respect to their Laplacian and normalized Laplacian spectrum

  • Received: 23 November 2023 Revised: 31 December 2023 Accepted: 10 January 2024 Published: 29 January 2024
  • MSC : 05C50, 05C90

  • As a powerful tool for describing and studying the properties of networks, the graph spectrum analyses and calculations have attracted substantial attention from the scientific community. Let Cn represent linear crossed phenylenes. Based on the Laplacian (normalized Laplacian, resp.) polynomial of Cn, we first investigated the Laplacian (normalized Laplacian, resp) spectrum of Cn in this paper. Furthermore, the Kirchhoff index, multiplicative degree-Kirchhoff, index and complexity of Cn were obtained through the relationship between the roots and the coefficients of the characteristic polynomials. Finally, it was found that the Kirchhoff index and multiplicative degree-Kirchhoff index of Cn were approximately one quarter of their Wiener index and Gutman index, respectively.

    Citation: Zhi-Yu Shi, Jia-Bao Liu. Topological indices of linear crossed phenylenes with respect to their Laplacian and normalized Laplacian spectrum[J]. AIMS Mathematics, 2024, 9(3): 5431-5450. doi: 10.3934/math.2024262

    Related Papers:

    [1] Ze-Miao Dai, Jia-Bao Liu, Kang Wang . Analyzing the normalized Laplacian spectrum and spanning tree of the cross of the derivative of linear networks. AIMS Mathematics, 2024, 9(6): 14594-14617. doi: 10.3934/math.2024710
    [2] Jahfar T K, Chithra A V . Central vertex join and central edge join of two graphs. AIMS Mathematics, 2020, 5(6): 7214-7233. doi: 10.3934/math.2020461
    [3] Jia-Bao Liu, Kang Wang . The multiplicative degree-Kirchhoff index and complexity of a class of linear networks. AIMS Mathematics, 2024, 9(3): 7111-7130. doi: 10.3934/math.2024347
    [4] Muhammad Ajmal, Xiwang Cao, Muhammad Salman, Jia-Bao Liu, Masood Ur Rehman . A special class of triple starlike trees characterized by Laplacian spectrum. AIMS Mathematics, 2021, 6(5): 4394-4403. doi: 10.3934/math.2021260
    [5] Wafaa Fakieh, Amal Alsaluli, Hanaa Alashwali . Laplacian spectrum of the unit graph associated to the ring of integers modulo pq. AIMS Mathematics, 2024, 9(2): 4098-4108. doi: 10.3934/math.2024200
    [6] Zhen Lin . The biharmonic index of connected graphs. AIMS Mathematics, 2022, 7(4): 6050-6065. doi: 10.3934/math.2022337
    [7] Meiling Hu, Shuli Li . Cospectral graphs for the normalized Laplacian. AIMS Mathematics, 2022, 7(3): 4061-4067. doi: 10.3934/math.2022224
    [8] In Hyoun Kim, Yun-Ho Kim . Existence, uniqueness, and localization of positive solutions to nonlocal problems of the Kirchhoff type via the global minimum principle of Ricceri. AIMS Mathematics, 2025, 10(3): 4540-4557. doi: 10.3934/math.2025210
    [9] Milica Anđelić, Saleem Khan, S. Pirzada . On graphs with a few distinct reciprocal distance Laplacian eigenvalues. AIMS Mathematics, 2023, 8(12): 29008-29016. doi: 10.3934/math.20231485
    [10] Yinzhen Mei, Chengxiao Guo . The minimal degree Kirchhoff index of bicyclic graphs. AIMS Mathematics, 2024, 9(7): 19822-19842. doi: 10.3934/math.2024968
  • As a powerful tool for describing and studying the properties of networks, the graph spectrum analyses and calculations have attracted substantial attention from the scientific community. Let Cn represent linear crossed phenylenes. Based on the Laplacian (normalized Laplacian, resp.) polynomial of Cn, we first investigated the Laplacian (normalized Laplacian, resp) spectrum of Cn in this paper. Furthermore, the Kirchhoff index, multiplicative degree-Kirchhoff, index and complexity of Cn were obtained through the relationship between the roots and the coefficients of the characteristic polynomials. Finally, it was found that the Kirchhoff index and multiplicative degree-Kirchhoff index of Cn were approximately one quarter of their Wiener index and Gutman index, respectively.



    In recent years, researchers have been interested in the study of complex networks [1,2,3,4]. Three common characteristics of complex networks are: small-world, scale-free, and fractal. Yang and Huang et al. [5,6] have determined the Kirchhoff index and multiplicative degree-Kirchhoff index of hexagonal chains, and they obtained that the Kirchhoff index and multiplicative degree-Kirchhoff index of hexagonal chains are approximately half of their Wiener index and Gutman index, respectively. In particular, Peng et al. [7] studied the Kirchhoff index and complexity for linear phenylenes, and determined that the Kirchhoff index of linear phenylenes is approximately half of its Wiener index. In addition, Z. Zhu and J.-B. Liu [8] obtained the multiplicative degree-Kirchhoff index and complexity of generalized phenylenes. In 2018, Pan and Li [9] determined the Kirchhoff index, multiplicative degree-Kirchhoff index, and complexity of linear crossed hexagonal networks, and obtained that the Kirchhoff index and multiplicative degree-Kirchhoff index of linear crossed hexagonal chains are approximately one quarter of their Wiener index and Gutman index, respectively. For other networks, see [10,11,12,13,14].

    Motivated by these, we investigate the Laplacian and normalized Laplacian spectra of linear crossed phenylenes. We also obtain that the Kirchhoff index and multiplicative degree-Kirchhoff index of linear crossed phenylenes are approximately one quarter of their Wiener index and Gutman index, respectively.

    In this paper, we suppose G=(EG,VG) is a graph with edge set EG={e1,e2,,em} and vertex set VG={v1,v2,,vn}. For more notations, one can be referred to [15].

    Let D(G)=diag{d1,d2,,dn} represent a degree matrix, and A(G) be the adjacency matrix, where di is the degree of vi. Therefore, we can calculate the Laplacian matrix and normalized Laplacian matrix, which are defined as L(G)=D(G)A(G) and L(G)=D(G)12LD(G)12, respectively. The Laplacian matrix is

    (L(G))ij={di,i=j;1,ij,viandvjareadjacent;0,otherwise. (1.1)

    The normalized Laplacian matrix is

    (L(G))ij={1,i=j,di0;1didj,ij,viandvjareadjacent;0,otherwise. (1.2)

    The distance between vertices vi and vj, denoted by dij, is defined as the length of the shortest path between vertices vi and vj. The Wiener index [16,17] is defined as

    W(G)=i<jdij. (1.3)

    In 1994, the Gutman index [18] is defined as

    Gut(G)=i<jdidjdij. (1.4)

    Klein and Randić [19] were the first to put forward the concept of resistance distance, and the resistance distance between vertices vi and vj is denoted by rij. Klein et al. [20,21] introduced the Kirchhoff index as Kf(G)=i<jrij. In 2007, Chen et al. [22] proposed the multiplicative degree-Kirchhoff index as Kf(G)=i<jdidjrij. Gutman and Mohar [23] introduced the Kirchhoff index as

    Kf(G)=nnk=21μk, (1.5)

    where 0=μ1<μ2μn(n2) are the eigenvalues of L(G).

    According to the normalized Laplacian, Chen et al. [22] proposed the multiplicative degree-Kirchhoff index as

    Kf(G)=2mnk=21λk, (1.6)

    where λ1λ2λn are the normalized Laplacian eigenvalues of L(G).

    The number of spanning trees of G can also be called the complexity of G [15], denoted by τ(G).

    In Section 2, we mainly introduce some notations and theorems. Next, applying the relationship between the roots and coefficients of Cn, the Laplacian spectrum of Cn is determined in Section 3. In Section 4, we obtain the normalized Laplacian spectrum of Cn in the same way as in Section 3. The conclusion is summarized in Section 5.

    First, we state some notations and theorems, which will be used later.

    Given an n×n matrix M, the submatrix of M is represented by M[i1,,ik], where M[i1,,ik] is formed by removing the i1-th, , ik-th rows and columns of M. Let PM(x)=det(xIM) represent the characteristic polynomial of M.

    Label linear crossed phenylenes as shown in Figure 1. Evidently, |V(Cn)|=6n+2,|E(Cn)|=14n+1 and π=(1,1)(2,2)(3n+1,(3n+1)) is an automorphism of Cn. Set V1={1,2,,3n+1},V2={1,2,,(3n+1)}.

    Figure 1.  Linear crossed phenylenes Cn.

    Thus, L(Cn) and L(Cn) can be expressed by

    L(Cn)=(LV1V1LV1V2LV2V1LV2V2),L(Cn)=(LV1V1LV1V2LV2V1LV2V2),

    where

    LV1V1=LV2V2,LV1V2=LV2V1,LV1V1=LV2V2,LV1V2=LV2V1.

    Let

    T=(12I3n+112I3n+112I3n+112I3n+1),

    then

    TL(Cn)T=(LA00LS),TL(Cn)T=(LA00LS),

    where T is the transpose of the matrix T and

    LA=LV1V1+LV1V2,LS=LV1V1LV1V2,LA=LV1V1+LV1V2,LS=LV1V1LV1V2.

    Theorem 2.1. [24] If LA,LS,LA,LS are defined as above, the following formula can be obtained:

    PL(Cn)(x)=PLA(x)PLS(x),PL(Cn)(x)=PLA(x)PLS(x).

    Theorem 2.2. [15] If G is a graph with |VG|=n and |EG|=m, then

    2mτ(G)=ni=1dini=2λi,

    where τ(G) is the complexity of G, and λi is the normalized Laplacian eigenvalue of L(G).

    In this section, we mainly calculate the Kirchhoff index and Wiener index of Cn.

    According to (1.1), we can get LV1V1 and LV1V2:

    LV1V1=(3114115115114115115114115113)(3n+1)×(3n+1),
    LV1V2=(1110111111110111111110111111)(3n+1)×(3n+1).

    Based on Theorem 2.1, the Laplacian spectrum consists of the eigenvalues of LA, and LS of Cn can be obtained.

    LA=(2224224224224224224224224222)(3n+1)×(3n+1),
    LS=diag(4,4,6,6,4,6,,6,4,6,4)(3n+1).

    Assume that 0=α1<α2α3α3n+1 are the roots of PLA(x), and 0<β1β2β3β3n+1 are the roots of PLS(x). By (1.5), we have

    Kf(Cn)=(6n+2)(3n+1i=21αi+3n+1i=11βi). (3.1)

    It is obvious from the matrix LS that the following expression can be obtained:

    3n+1i=11βi=14×(n+2)+16×(2n1)=7n+412. (3.2)

    Thus, we need to calculate the first sum in (3.1).

    Let

    PLA(x)=det(xILA)=x3n+1+a1x3n++a3nx.

    Based on the Vietas Theorem of PLA(x), we can get

    3n+1i=21αi=(1)3n1a3n1(1)3na3n. (3.3)

    Obviously, we obtain that (1)3na3n is the sum of all the principal minors of order 3n of LA and (1)3n1a3n1 is the sum of all the principal minors of order 3n1 of LA. So, let Fk be the k-th order principal submatrix, which consists of the first k columns and k rows of LA, and fk=det(Fk), k=1,2,,3n. Thus, we can get f1=2,f2=4, and for 1i3n,

    fi=4fi14fi2.

    The solution of the previous recurrence relation is

    fi=2i.

    Now, let Hk be the k-th order principal submatrix, which consists of the last k columns and k rows of LA, and hk=det(Hk), k=1,2,,3n. Based on the symmetry matrix LA, one gets hk=fk, and let f0=1.

    Fact 1. (1)3na3n=(3n+1)23n.

    Proof. Since (1)3na3n is the sum of all the principal minors of order 3n of LA, we have

    (1)3na3n=2f3n+3ni=2fi1f3n+1i=3n+1i=1fi1f3n+1i=(3n+1)23n.

    This completes the proof.

    Fact 2. (1)3n1a3n1=n(3n+1)(3n+2)23n2

    Proof. Since (1)3n1a3n1 is the sum of all the principal minors of order 3n1 of LA, we obtain

    (1)3n1a3n1=1i<j3n+1Nijfi1f3n+1j,

    where

    Nij=|4224224224224224|(ji1)×(ji1)=(ji)2ji1.

    Therefore, we can have

    (1)3n1a3n1=1i<j3n+1(ji)2ji1fi1f3n+1j=1i<j3n+1(ji)23n1=n(3n+1)(3n+2)23n2.

    The result is as desired.

    Together with (3.3) and Facts 1 - 2, we obtain the following lemma.

    Lemma 3.1. If 0=α1<α2α3α3n+1 are the eigenvalues of LA, one gets

    3n+1i=21αi=n(3n+2)4.

    Applying (3.1) - (3.2) and Lemma 3.1, we obtain the following theorem.

    Theorem 3.2. For linear crossed phenylenes Cn, we have

    Kf(Cn)=27n3+48n2+25n+46.

    The Kirchhoff indices of Cn are shown in Table 1, where 1n15.

    Table 1.  Kirchhoff indices from C1 to C15.
    G Kf(G) G Kf(G) G Kf(G) G Kf(G) G Kf(G)
    C1 17.33 C4 433.33 C7 1965.33 C10 5342.33 C13 11293.33
    C2 77.00 C5 784.00 C8 2850.00 C11 7004.00 C14 13975.00
    C3 206.67 C6 1285.67 C9 3966.67 C12 8978.67 C15 17050.67

     | Show Table
    DownLoad: CSV

    Theorem 3.3. Assume that Cn are the linear crossed phenylenes, then

    limnKf(Cn)W(Cn)=14.

    Proof. By first classifying and discussing the following cases of vertices, the Wiener index of Cn is obtained.

    ● Vertex 3j1(j=1,2,,n) of Cn:

    w1(i)=2+2(i1k=1k+3n+1ik=1k),i=3j1.

    ● Vertex 3j(j=1,2,,n) of Cn:

    w2(i)=1+2(i1k=1k+3n+1ik=1k),i=3j.

    ● Vertex 3j+1(j=1,2,,n1) of Cn:

    w3(i)=1+2(i1k=1k+3n+1ik=1k),i=3j+1.

    ● Vertex 1 of Cn:

    w4(i)=1+2(3nk=1k).

    In view of (1.3), we have

    W(Cn)=2i=3j1w1(i)+2i=3jw2(i)+2i=3j+1w3(i)+4w4(i)2=2nj=1[2+2(3j2k=1k+3n3j+2k=1k)]+2nj=1[1+2(3j1k=1k+3n3j+1k=1k)]2+2n1j=1[1+2(3jk=1k+3n3jk=1k)]+4(1+23nk=1k)2=18n3+18n2+8n+1.

    Combining with Kf(Cn) and W(Cn), we have

    limnKf(Cn)W(Cn)=14,

    as desired.

    In this section, we mainly calculate the multiplicative degree-Kirchhoff index, Gutman index, and complexity of Cn.

    According to (1.2), we can get LV1V1 and LV1V2:

    LV1V1=(111211211201201125125112012011201251120120112012011151151)(3n+1)×(3n+1),
    LV1V2=(131121120120120151251251512012001201251512012001201201511511513)(3n+1)×(3n+1).

    Based on Theorem 2.1, the normalized Laplacian spectrum consists of the eigenvalues of LA, and LS of Cn can be obtained.

    LA=(23131311515452252254515151151545225225451515115154521521523)(3n+1)×(3n+1),
    LS=diag(43,1,65,65,1,65,,65,1,65,43)(3n+1).

    Assume that 0=γ1<γ2γ3γ3n+1 are the roots of PLA(x), and 0<δ1δ2δ3δ3n+1 are the roots of PLS(x). By (1.6), we have

    Kf(Cn)=(28n+2)(3n+1i=21γi+3n+1i=11δi). (4.1)

    It is obvious from the matrix LS that the following expression can be obtained:

    3n+1i=11δi=1×n+56×(2n1)+34×2=8n+23. (4.2)

    Therefore, we need to calculate the first sum in (4.1).

    Let

    PLA(x)=det(xILA)=x3n+1+b1x3n++b3nx.

    Based on the Vietas Theorem of PLA(x), we can get

    3n+1i=21γi=(1)3n1b3n1(1)3nb3n. (4.3)

    Obviously, we obtain that (1)3nb3n is the sum of all the principal minors of order 3n of LA and (1)3n1b3n1 is the sum of the principal minors of order 3n1 of LA. So, let Tk be the k-th order principal submatrix, which consists of the first k columns and k rows of LA, and tk=det(Tk), k=1,2,,3n. Thus, we can get t1=23,t2=13,t3=215, and for 1in1,

    {t3i+1=45t3i425t3i1;t3i+2=t3i+115t3i;t3i+3=45t3i+215t3i+1.

    The solution of the previous recurrence relation is

    {t3i2=253(225)i;t3i1=256(225)i;t3i=53(225)i;

    where 1in.

    Now, let Sk be the k-th order principal submatrix, which consists of the last k columns and k rows of LA, and sk=det(Sk), k=1,2,,3n. Thus, we can get s1=23,s2=415,s3=215, and for 1in1,

    {s3i+1=45s3i15s3i1;s3i+2=45s3i+1425s3i;s3i+3=s3i+215s3i+1.

    The solution of the previous recurrence relation is

    {s3i2=253(225)i;s3i1=103(225)i;s3i=53(225)i;

    where 1in.

    Without loss of generality, let t0=1 and s0=1.

    Fact 1. (1)3nb3n=59(14n+1)(225)n.

    Proof. By a similar discussion as in Section 3, we obtain that (1)3nb3n is the sum of all the principal minors of order 3n of LA,

    (1)3nb3n=3n+1j=1tj1s3n+1j=t3n+s3n+3nj=2tj1s3n+1j=253(225)n+ni=1253(225)i103(225)ni+1+ni=1256(225)i253(225)ni+1+n1i=153(225)i53(225)ni=59(14n+1)(225)n.

    The result is as desired.

    Fact 2. (1)3n1b3n1=98n3+21n2+9n45(225)n1.

    Proof. Since (1)3n1b3n1 is the sum of all the principal minors of order 3n1 of LA, one has

    (1)3n1b3n1=1i<j3n+1detLA[i,j]ti1s3n+1j. (4.4)

    In view of (4.4), all possible cases are listed.

    Case 1. i=3p,j=3q,1p<qn,

    detLA[3p,3q]=|45151511515452251511515452252254515151|(3q3p1)×(3q3p1)=35(qp)(225)qp1.

    Case 2. i=3p,j=3q+1,1pqn,

    detLA[3p,3q+1]=|451515115154522515452252254515151151545|(3q3p)×(3q3p)=225[3(qp)+1](225)qp1.

    Case 3. i=3p,j=3q+2,1pqn1,

    detLA[3p,3q+2]=|4515151151545225225451515115154522522545|(3q3p+1)×(3q3p+1)=25[3(qp)+2](225)qp.

    Case 4. i=3p+1,j=3q,0p<qn,

    detLA[3p+1,3q]=|115154522522545151511515452252254515151|(3q3p2)×(3q3p2)=12[3(qp)1](225)qp1.

    Case 5. i=3p+1,j=3q+1,0p<qn,

    detLA[3p+1,3q+1]=|1151545225225451515452252254515151151545|(3q3p1)×(3q3p1)=35(qp)(225)qp1.

    Case 6. i=3p+1,j=3q+2,0pqn1,

    detLA[3p+1,3q+2]=|11515452252254515225451515115154522522545|(3q3p)×(3q3p)=[3(qp)+1](225)qp.

    Case 7. i=3p+2,j=3q,0p<qn,

    detLA[3p+2,3q]=|452252254515151151511515452252254515151|(3q3p3)×(3q3p3)=[3(qp)2](225)qp1.

    Case 8. i=3p+2,j=3q+1,0p<qn,

    detLA[3p+2,3q+1]=|4522522545151511515452252254515151151545|(3q3p2)×(3q3p2)=25[3(qp)1](225)qp1.

    Case 9. i=3p+2,j=3q+2,0p<qn1,

    detLA[3p+2,3q+2]=|45225225451515115225451515115154522522545|(3q3p1)×(3q3p1)=1225(qp)(225)qp1.

    Therefore, we can get

    (1)3n1b3n1=1i<j3n+1detLA[i,j]ti1s3n+1j=X1+X2+X3,

    where

    X1=1p<qndetLA[3p,3q]t3p1s3n3q+1+1pqndetLA[3p,3q+1]t3p1s3n3q+1pqn1detLA[3p,3q+2]t3p1s3n3q1=14n35n23n18(225)n1,
    X2=0p<qndetLA[3p+1,3q]t3ps3n3q+1+0p<qndetLA[3p+1,3q+1]t3ps3n3q+0pqn1detLA[3p+1,3q+2]t3ps3n3q1=70n3+31n2+37n90(225)n1,
    X3=0p<qndetLA[3p+2,3q]t3p+1s3n3q+1+0p<qndetLA[3p+2,3q+1]t3p+1s3n3q+0p<qn1detLA[3p+2,3q+2]t3p+1s3n3q1=245(14n3+9n2n)(225)n1.

    Thus, we can obtain

    (1)3n1b3n1=X1+X2+X3=98n3+21n2+9n45(225)n1,

    which is the desired result.

    Together with (4.3) and Facts 1 - 2, one can get the following lemma.

    Lemma 4.1. Assume that 0=γ1<γ2γ3γ3n+1 are the eigenvalues of LA, then one gets

    3n+1i=21γi=98n3+21n2+9n28n+2.

    According to (4.1) - (4.2) and Lemma 4.1, we obtain the following theorem.

    Theorem 4.2. For linear crossed phenylenes Cn, we have

    Kf(Cn)=294n3+287n2+99n+43.

    The multiplicative degree-Kirchhoff indices of Cn are shown in Table 2, where 1n15.

    Theorem 4.3. Assume that Cn are the linear crossed phenylenes, then

    limnKf(Cn)Gut(Cn)=14.

    Proof. By first classifying and discussing the following cases of vertices, the Gutman index of Cn is obtained.

    Table 2.  Multiplicative degree-Kirchhoff indices from C1 to C15.
    G Kf(G) G Kf(G) G Kf(G) G Kf(G) G Kf(G)
    C1 208.00 C4 7688.00 C7 37806.00 C10 106438.00 C13 229460.00
    C2 1166.00 C5 14428.00 C8 55620.00 C11 140618.00 C14 285298.00
    C3 3463.33 C6 24271.33 C9 78301.33 C12 181429.33 C15 349531.33

     | Show Table
    DownLoad: CSV

    ● Vertex 3i1(i=1,2,,n) of Cn:

    g3i1=2ni=1[4×4×2+2×3×4×(3i2)+2×3×4×(3n3i+2)+2i1k=14×4×3×(ik)+2nk=i+14×4×3×(ki)+2ik=24×5×(3i3k+1)+2nk=i+14×5×(3k3i1)+2i1k=14×5×(3ik1)+2nk=i4×5×(3k3i+1)]=8(28n3+3n2+5n).

    ● Vertex 3i(i=1,2,,n) of Cn:

    g3i=2ni=1[5×5×1+2×3×5×(3i1)+2×3×5×(3n3i+1)+2ik=14×5×(3i3k+1)+2nk=i+14×5×(3k3i1)+2ik=25×5×(3i3k+2)+2nk=i+15×5×(3k3i2)+2i1k=15×5×3×(ik)+2nk=i+15×5×3×(ki)]=10(28n3+3n2).

    ● Vertex 3i2(i=2,3,,n) of Cn:

    g3i2=2ni=2[5×5×1+2×3×5×(3i3)+2×3×5×(3n3i+3)+2i1k=14×5×(3i3k1)+2nk=i4×5×(3k3i+1)+2i1k=25×5×3×(ik)+2nk=i+15×5×3×(ki)+2i1k=15×5×(3i3k2)+2nk=i5×5×(3k3i+2)]=10(28n339n2+16n5).

    ● Corner vertex of Cn:

    go=2[3×3×1+2×3×3×3n+2(ni=13×4(3i2)+ni=13×5×(3i1)+ni=23×5×(3i3))]+2[3×3×1+2×3×3×3n+2(ni=13×4×(3n3i+2)+ni=13×5×(3n3i+1)+ni=23×5×(3n3i+3))]=504n2+36n+36.

    Applying (1.4), we obtain

    Gut(Cn)=go+g3i1+g3i2+g3i2=392n3+84n2+118n7.

    Combining with Kf(Cn) and Gut(Cn), one has

    limnKf(Cn)Gut(Cn)=14.

    This completes the proof.

    In the following, we can calculate the complexity of Cn.

    Theorem 4.4. For linear crossed phenylenes Cn, we have

    τ(Cn)=27n+232n1.

    Proof. Based on Theorem 2.2, we can get 6n+2i=1di3n+1i=2γi3n+1i=1δi=2(14n+1)τ(Cn),

    where

    6n+2i=1di=3442n54n2,
    3n+1i=2γi=(1)3nb3n=59(14n+1)(225)n,
    3n+1i=1δi=(43)2(65)2n1.

    Hence,

    τ(Cn)=27n+232n1.

    The result is as desired.

    The complexity of Cn is shown in Table 3, where 1n12.

    Table 3.  The complexity from C1 to C12.
    G τ(G) G τ(G)
    C1 1536 C7 3590096234354105647104
    C2 1769472 C8 4135790861975929705463808
    C3 2038431744 C9 4764431072996271020694306816
    C4 2348273369088 C10 5488624596091704215839841452032
    C5 2705210921189376 C11 6322895534697643256647497352740864
    C6 3116402981210161152 C12 7283975655971685031657916950357475328

     | Show Table
    DownLoad: CSV

    Based on the Laplacian (normalized Laplacian, resp) polynomial of Cn, we determined the Kirchhoff index, multiplicative degree-Kirchhoff index, and complexity of linear crossed phenylenes through the decomposition theorem and Vietas Theorem. In addition, we found that the Kirchhoff index and multiplicative degree-Kirchhoff index of linear crossed phenylenes were approximately one quarter of their Wiener index and Gutman index, respectively, which further enriched the results of the Kirchhoff index, multiplicative degree-Kirchhoff index, and complexity for the linear crossed chains.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This work was supported in part by Anhui Provincial Natural Science Foundation Project under Grant KJ2021A1175, Funding project for cultivating top-notch talents in universities under Grant gxgnfx2022096, Anhui Provincial Education Reform Research Project under Grant 2022jyxm481, Anhui Provincial Natural Science Foundation Project under Grant 2023AH051697.

    All authors declare no conflicts of interest in this paper.



    [1] J. Chen, A. B. Le, Q. Wang, L. Xi, A small-world and scale-free network generated by Sierpinski Pentagon, Physica A, 449 (2016), 126–135. https://doi.org/10.1016/j.physa.2015.12.089 doi: 10.1016/j.physa.2015.12.089
    [2] W. Sun, M. Sun, J. Guan, Q. Jia, Robustness of coherence in noisy scale-free networks and applications to identification of influential spreaders, IEEE T. Circuits-Ⅱ, 67 (2019), 1274–1278. https://doi.org/10.1109/TCSII.2019.2929139 doi: 10.1109/TCSII.2019.2929139
    [3] W. Sun, Q. Ding, J. Zhang, F. Chen, Coherence in a family of tree networks with an application of Laplacian spectrum, Chaos, 24 (2014), 043112. https://doi.org/10.1063/1.4897568 doi: 10.1063/1.4897568
    [4] X. Qi, E. Fuller, R. Luo, G. Guo, C. Zhang, Laplacian energy of digraphs and a minimum Laplacian energy algorithm, Int. J. Found. Comput. Sci., 26 (2015), 367–380. https://doi.org/10.1142/S0129054115500203 doi: 10.1142/S0129054115500203
    [5] Y. J. Yang, H. P. Zhang, Kirchhoff index of linear hexagonal chains, Int. J. Quantum Chem., 108 (2008), 503–512. https://doi.org/10.1002/qua.21537 doi: 10.1002/qua.21537
    [6] J. Huang, S. C. Li, L. Sun, The normalized Laplacians degree-Kirchhoff index and the spanning trees of linear hexagonal chains, Discrete Appl. Math., 207 (2016), 67–79. https://doi.org/10.1016/j.dam.2016.02.019 doi: 10.1016/j.dam.2016.02.019
    [7] Y. J. Peng, S. C. Li, On the kirchhoff index and the number of spanning trees of linear phenylenes, Match Communications in Mathematical and in Computer Chemistry, 77 (2017), 765–780.
    [8] Z. X. Zhu, J. B. Liu, The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes, Discrete Appl. Math., 254 (2019), 256–267. https://doi.org/10.1016/j.dam.2018.06.026 doi: 10.1016/j.dam.2018.06.026
    [9] Y. Pan, J. Li, Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed hexagonal chains, Int. J. Quantum Chem., 118 (2018), e25787. https://doi.org/10.1002/qua.25787 doi: 10.1002/qua.25787
    [10] D. Zhao, Y. Zhao, Z. Wang, X. Li, K. Zhou, Kirchhoff index and degree Kirchhoff index of Tetrahedrane-derived compounds, Symmetry, 15 (2023), 1122. https://doi.org/10.3390/sym15051122 doi: 10.3390/sym15051122
    [11] J. Wang, L. Liu, H. Zhang, On the Laplacian spectra and the Kirchhoff indices of two types of networks, Optimization, (2023). https://doi.org/10.1080/02331934.2023.2268631
    [12] X. Geng, P. Wang, L. Lei, S. Wang, On the Kirchhoff indices and the number of spanning trees of M¨obius phenylenes chain and Cylinder phenylenes chain, Polycycl. Aromat. Comp., 41 (2021), 1681–1693. https://doi.org/10.1080/10406638.2019.1693405 doi: 10.1080/10406638.2019.1693405
    [13] X. Ma, H. Bian, The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal M¨obius graphs, Appl. Math. Comput., 355 (2019), 33–46. https://doi.org/10.1016/j.amc.2019.02.052 doi: 10.1016/j.amc.2019.02.052
    [14] J. Huang, S. C. Li, X. Li, The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains, Appl. Math. Comput., 289 (2016), 324–334. https://doi.org/10.1016/j.amc.2016.05.024 doi: 10.1016/j.amc.2016.05.024
    [15] F. R. K. Chung, Spectral Graph Theory, American Mathematical Society Providence, RI, 1997.
    [16] H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc., 69 (1947), 17–20. https://doi.org/10.1021/ja01193a005 doi: 10.1021/ja01193a005
    [17] A. Dobrynin, Branchings in trees and the calculation of the Wiener index of a tree, Match Communications in Mathematical and in Computer Chemistry, 41 (2000), 119–134.
    [18] I. Gutman, Selected properties of the Schultz molecular topological index, Journal of Chemical Information and Computer Sciences, 34 (1994), 1087–1089. https://doi.org/10.1021/ci00021a009 doi: 10.1021/ci00021a009
    [19] D. J. Klein, M. Randić, Resistance distances, J. Math. Chem., 12 (1993), 81–95. https://doi.org/10.1007/BF01164627 doi: 10.1007/BF01164627
    [20] D. J. Klein, Resistance-distance sum rules, Croat. Chem. Acta, 75 (2002), 633–649. https://hrcak.srce.hr/127542
    [21] D. J. Klein, O. Ivanciuc, Graph cyclicity, excess conductance, and resistance deficit, J. Math. Chem., 30 (2001), 271–287. https://doi.org/10.1023/A:1015119609980 doi: 10.1023/A:1015119609980
    [22] H. Y. Chen, F. J. Zhang, Resistance distance and the normalized Laplacian spectrum, Discrete Appl. Math., 155 (2007), 654–661. https://doi.org/10.1016/j.dam.2006.09.008 doi: 10.1016/j.dam.2006.09.008
    [23] I. Gutman, B. Mohar, The quasi-Wiener and the Kirchhoff indices coincide, J. Chem. Inf. Model., 36 (1996), 982–985. https://doi.org/10.1021/ci960007t doi: 10.1021/ci960007t
    [24] Y. L. Yang, T. Y. Yu, Graph theory of viscoelasticities for polymers with starshaped, multiple-ring and cyclic multiple-ring molecules, Macromol. Chem. Phys., 186 (1985), 609–631. https://doi.org/10.1002/macp.1985.021860315 doi: 10.1002/macp.1985.021860315
  • This article has been cited by:

    1. Wensheng Sun, Muhammad Shoaib Sardar, Yujun Yang, Shou-Jun Xu, On the Resistance Distance and Kirchhoff Index of Kn-chain(Ring) Network, 2024, 43, 0278-081X, 4728, 10.1007/s00034-024-02709-y
    2. Muhammad Shoaib Sardar, Shou-Jun Xu, Resistance Distance and Kirchhoff Index in Windmill Graphs, 2025, 22, 15701794, 159, 10.2174/0115701794299562240606054510
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1058) PDF downloads(72) Cited by(2)

Figures and Tables

Figures(1)  /  Tables(3)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog