Skip to main content
Molecules logoLink to Molecules
. 2022 Sep 18;27(18):6081. doi: 10.3390/molecules27186081

Hosoya Polynomials of Power Graphs of Certain Finite Groups

Bilal Ahmad Rather 1, Fawad Ali 2,3,*, Suliman Alsaeed 4, Muhammad Naeem 5,*
Editor: Jia-Bao Liu
PMCID: PMC9505087  PMID: 36144814

Abstract

Assume that G is a finite group. The power graph P(G) of G is a graph in which G is its node set, where two different elements are connected by an edge whenever one of them is a power of the other. A topological index is a number generated from a molecular structure that indicates important structural properties of the proposed molecule. Indeed, it is a numerical quantity connected with the chemical composition that is used to correlate chemical structures with various physical characteristics, chemical reactivity, and biological activity. This information is important for identifying well-known chemical descriptors based on distance dependence. In this paper, we study Hosoya properties, such as the Hosoya polynomial and the reciprocal status Hosoya polynomial of power graphs of various finite cyclic and non-cyclic groups of order pq and pqr, where p,q and r(pqr) are prime numbers.

Keywords: finite groups, molecular structure, power graphs, Hosoya polynomial

1. Introduction

Quantitative structure–property relationships (QSPR) studies are provided by the physicochemical characteristics and topological indices, such as the atom–bond connectivity index, the geometric–arithmetic index, and the Randić index, which identify the bioactivity of chemical compounds. In fact, a topological index is created by converting a chemical structure (i.e., a graph) to a numerical value. It establishes relationships between various physicochemical properties of molecular structured chemical compounds, including the stability, the boiling point, and the strain energy. It is a numerical number that quantifies a molecular structure’s symmetries, defines its topology, and is constantly under a structure-preserving function [1]. Several topological indices may be used to explore specific properties of chemical substances with a microstructure. In 1947, Wiener developed the concept of the topological index, which he termed the path number while exploring the boiling point of paraffin [2]. As a consequence, it became known as the Wiener index, and this was the origin of the concept of topological indices. Numerous degree-based and distance-based topological indices have been presented and calculated in the past few years; for instance, see [3,4,5,6,7].

Various scientists utilized Pólya’s [8] concept of evaluating polynomials to determine the unsaturated hydrocarbon’s molecular orbital. The graph spectra have been widely studied in this context. Hosoya [9] employed this concept in 1988 to establish the polynomials of various chemical structures that became referred to as the Hosoya polynomials and garnered worldwide attention. This polynomial was called the Wiener polynomial by Sagan et al. [10] in 1996; however, several researchers referred to it as the Hosoya polynomial. The Hosoya polynomial provides details on graph invariants depending on the distance. In [11], Cash proposed a link amongst the Hosoya polynomial and the hyper Wiener index. Estrada et al. [12] examined several fascinating uses of the extended Wiener indices.

The graphs shown in this article are simple, without loops or multiple edges. Assume that G is a finite group. The power graph P(G) of G is a graph whose node set is G and two different elements are joined by an edge whenever one is the power of the other. Kelarev and Quinn gave the notion of directed power graphs concerning semigroups and groups [13]. Afterward, in [14], the authors demonstrated the P(S) of a semigroup S and defined the class of semigroups whose power graphs are complete. Additionally, they explained when the power graph of a group G is complete whenever the group G is cyclic of order prime power or one.

The power graph is a popular topic in various mathematics disciplines, including Lie algebra, ring theory, and group theory. The authors of [15] examined matching numbers and established upper and lower limits on the perfect matching of power graphs associated with specific groups. Furthermore, they demonstrated how to generate matching numbers for each finite nilpotent group. The authors of [16] focused on power indices graphs while categorizing all graphs into a few predefined groups. In [17], the authors investigated the greatest clique and discovered that power graphs have the maximum number of edges for every finite cyclic group. The node connectivity of P(Zn), where n is the product of certain prime numbers, was studied in [18]. Additionally, several other scholars investigated other algebraic graph notions; for example, see [19,20,21,22,23,24,25,26,27].

Matching is the set of edges that do not intersect with any nodes. A node is said to be matched if it coincides with one of the matching edges. Alternatively, an unmatched node is present. The Hosoya index or Z-index indicates a graph’s greatest number of matchings. Hosoya [28] invented the Z-index in 1971 and later developed it to serve as a general mechanism for quantum chemistry [29]. It has now been proven to be extremely effective in various chemical issues, particularly the boiling point, entropy, and the heat of vaporization. Several researchers studied the extremal issues using the Hosoya index to use a variety of graph configurations. In [30,31,32,33,34,35], the excessive topological and Hosoya properties of various graphs, such as unicyclic graphs, Eulerian graphs, and trees were widely examined.

The Hosoya properties of general graphs are difficult to study, and providing exact formulae is very challenging. So, the authors restrict these properties to some classes of graphs and elaborate on various interesting properties, although gaps remain. Researchers [3,36,37,38,39] studied the topological indices such as the Hosoya polynomial of graphs defined on groups, such as fractal graphs, power graphs of finite groups, commuting, and non-commuting graphs of the group of symmetries. Calculating the (reciprocal) Hosoya polynomial of a power graph P(G) of an arbitrary group G is very complicated. Therefore, we have extended their work by finding the Hosoya as well as the reciprocal status Hosoya polynomials of power graphs of several finite groups of a different order.

The remaining article is organized as follows: Section 2 contains some relevant results and definitions useful for this paper. In Section 3, we explore the power graphs of finite cyclic as well as non-cyclic groups of order pq and pqr, whereas p,q and r(pqr) are different primes. Section 4 analyzes the reciprocal status Hosoya polynomial of power graphs of finite groups of order pq and pqr. Section 5 contains the conclusion of the paper.

2. Basic Notions and Notations

This section summarizes various basic graph–theoretic features and notable results that will be discussed later in the paper.

Assume that Γ is an undirected finite simple graph. The edge and node sets of Γ are indicated by E(Γ) and V(Γ), respectively. The distance from u1 to u2 in Γ symbolized by dis(u1,u2) is based on the length of the smallest path between them. The order of Γ is determined as the number of nodes, which is indicated by |Γ|. Two distinct nodes v1 and v2 are connected if they share an edge, and it is represented by v1v2; otherwise, v1v2. The degree or valency of a node u1 is deg(u1), which represents the set of nodes in Γ that are edge connected to u1. A u1u2 path having dis(u1,u2) length is known as a u1u2 geodesic. The greatest distance between u1 and other nodes in Γ is referred to as the eccentricity and is indicated by the symbol ec(u1). The diameter denoted by diam(Γ) of Γ is the greatest eccentricity amongst all the nodes of Γ. Additionally, the radius denoted by rad(Γ) is the least eccentricity of all the nodes in Γ.

Assume that Γ is a connected graph of degree n. Hosoya defines the polynomial of Γ as given below:

H(Γ,y)=i0dis(Γ,i)yi. (1)

The coefficient dis(Γ,i) denotes the total of (v,w) pairs of nodes such that dis(v,w)=i, where idiam(Γ). In [40], the authors presented the following reciprocal status Hosoya polynomial for Γ:

Hrs(Γ,y)=vwE(Γ)yrs(v)+rs(w), (2)

where rs(w)=vV(Γ),vw1dis(w,v) is called the reciprocal status or the reciprocal transmission of w.

Assume that Γ1 and Γ2 are two graphs that are connected; then, Γ1Γ2 is the join of Γ1 and Γ2 where the node and edge sets are V(Γ1)V(Γ2) and

E(Γ1)E(Γ2)yz:yV(Γ1),zV(Γ2),

respectively. An edge connecting any two nodes in a graph is known as a complete graph, and it is represented by Kn. Additional undefined terms and notations were obtained from [41,42].

We denote the cyclic group of order n by Zn. In addition, the direct product of groups G1,G2,,Gn having binary operations 1,2,,n, respectively, is the collection of all ordered n-tuples (x1,x2,,xn) component-wise operation defined by

(x1,x2,,xn)(x1,x2,,xn)=(x11x1,x22x2,,xnnxn),

where xiixi is the product in Gi for each i. Similarly, for the definition of semidirect product of groups, see ([43], p. 177).

3. Hosoya Polynomials

The following result gives the structure of power graphs of finite groups of order pq.

Lemma 1

([44]). Assume that G is a finite group and |G|=pq, whereas p and q (p<q) are primes. Then, the subsequent properties hold.

  •  (i) 

    P(G)Kpqpq+2Kp1Kq1 if and only if G is cyclic.

  •  (ii) 

    P(G)K1Kp1Kp1Kp1qKq1 if and only if G is non-cyclic.

Next, the following result provides the Hosoya polynomial of power graphs of a finite group G of order pq.

Theorem 1.

Suppose G is a finite group and |G|=pq,(p<q). Then, the subsequent holds.

  •  (i) 
    If G is cyclic of order n=pq, then
    HP(G),y=pqpq+1y2+12(pq)23pq+2p+2q2y+pq.
  •  (ii) 
    If G is non-cyclic of order n=pq, then
    HP(G),y=q2p1p+1q1y2+q2p2+qp1y+pq.

Proof. 

By the definition of Hosoya coefficients given in Equation (1), we need to determine dis(P(G),0),dis(P(G),1), and disP(G),2. Consider now a node set Vk that contains any pair of P(G) nodes; then,

|Vk|=pq2+pq=pq(pq+1)2.

Suppose

C(P(G),)=(j,k);j,kV(P(G))|dis(j,k)=,

and dis(P(G),)=|C(P(G),)|. Then:

Vk=C(P(G),0)C(P(G),1)C(P(G),2). (3)

Since, for each jV(P(G)), dis(j,j)=0, so

C(P(G),0)=(j,j);jV(P(G)),

and is equal to V(P(G)). Therefore, C(P(G),0)=n. Applying (i) of Lemma 1, we have P(G)Kpqpq+2Kp1Kq1 with V(Kpqpq+2)=A1,V(Kp1)=A2, and V(Kq1)=A3. Therefore,

C(P(G),1)=(j,k);jA1,kA2(j,k);jA1,kA3(j,k);k,jA1andkj(j,k);k,jA2andkj(j,k);k,jA3andkj.

Consequently,

C(P(G),1)=(2+pqqp)(p1)+(2+pqqp)(q1)+2+pqqp2+p12+q12=12(pq)23pq+2p+2q2.

Using Equation (3), we obtain:

|Vk|=disP(G),0+disP(G),1+disP(G),2.

Hence,

disP(G),2=|Vk|disP(G),0disP(G),1=pq(pq+1)2pq12(pq)23pq+2p+2q2=pqqp+1.

Now, by Equation (1) and using the above calculation, we obtain

H(P(G),y)=(pqpq+1)y2+12(pq)23pq+2p+2q2y+pq.

(ii) Using Lemma 1, the power graph of G is P(G)K1Kp1Kp1Kp1qKq1. Let V(Kq1)=A1,V(Kp1)=A2 and retaining other notation as given in (i), we obtain:

C(P(G),1)=(j,k);kA1,j=ej=1q(j,k);kA2,j=e(j,k);kA1,j=eandkjj=1q(j,k);kA2,j=eandkj.

Thereby, it follows that

C(P(G),1)=q1+q(p1)+q12+qp12=q2p2+qp1.

Using Equation (3), we obtain

disP(G),2=|Vk|disP(G),0disP(G),1=pq(pq+1)2pqq2p2+qp1=q2(q1)(p+1)(p1).

Thus, the Hosoya polynomial of P(G) is given below:

H(P(G),y)=q2(p1)(p+1)(q1)y2+q2(p2+qp1)y+pq.

We denote G(p,q,r) as the class of all finite groups whose order is pqr, whereas p,q,r are primes. Hölder [45] (see, also [46]) investigated the structures of groups in G(p,q,r). For p=q=r, there are five groups of order p3 that are given as:

Zp×Zp2,Zp×Zp×Zp,ZpZp2,ZpZp×Zp,Zp3,

where ⋊ is the semidirect product and × is the direct product of groups. For p>q>r, the groups of order pqr are given below:

  • Zpqr,Fp,qr,(qr|p1),Zp×Fq,r,(r|q1),Zr×Fp,q,(q|p1),Zq×Fp,r,(r|p1),

  • Gi+5α,β,γ:αp=βq=γr=1,αβ=βγ,γ1βγ=βu,γ1αγ=αvi, where q1,r|p1, o(u)=r in Zq* and o(v)=r in Zp*(1ir1).

Suppose for r=3, we have following groups of order 3pq, for Gi+5.

G6=α,β,γ:αp=βq=γ3=1,αβ=βα,γ1βγ=βu,γ1αγ=αv, where o(u)=3 in Zq* and o(v)=3 in Zp*.

G7=α,β,γ:αp=βq=γ3=1,αβ=βα,γ1βγ=βu,γ1αγ=αv2, where o(u)=3 in Zq* and o(v)=3 in Zp*.

Based on these finite groups of order pqr, we find the Hosoya polynomials of their power graphs.

Theorem 2.

The Hosoya polynomial of P(G) of the group G=Zp×Zp2 is given as:

H(P(G),y)=p2(p3+p2+3p+1)(p1)2y2+p2(p1)(p3p2+2p+1)y+p3.

Proof. 

First, we find the Hosoya coefficients, dis(P(G),0),dis(P(G),1), and dis(P(G),2) of P(G). The node set Vk for any pair of nodes of P(G) is given below:

|Vk|=p32+p3=p3(p3+1)2.

Clearly, C(P(G),0)=pqr. In addition, the structure of P(G) ( see [47]) is given as:

P(G)K1Kp1Kp1ptimesKp1Kp2pKp2pKp2pptimes.

Suppose V(Kp1)=A1,V(Kp2p)=A2, and denote one of the remaining p copies of nodes of V(Kp1) by A3. Thus:

C(P(G),1)={(j,k);kA1,j=e(j,k);kA2,j=e(j,k);kA3,j=e(j,k);k,jA1andkjj=1p(j,k);k,jA2andkjj=1p(j,k);k,jA3andkj}.

Consequently,

C(P(G),1)=p1+p(p2p)+p(p1)+p12+pp2p2+pp12=p2(p1)(p3p2+2p+1).

Therefore, from

|Vk|=disP(G),0+disP(G),1+disP(G),2,

we obtain

disP(G),2=|Vk|disP(G),0disP(G),1=p3(1+p3)2p3p2(p1)(p3p2+2p+1)=p2(p3+p2+3p+1)(p1)2.

By using the above values in Equation (1), we obtain

H(P(G),y)=p2(p3+p2+3p+1)(p1)2y2+p2(p3p2+2p+1)y+p3(p1).

Proceeding in the same manner as in Theorem 2 and noticing that (see [47]) P(Zp×Zp×Zp)=K1i=1p2+p+1Kp1, we have the following result for the power graph of Zp×Zp×Zp.

Theorem 3.

The Hosoya polynomial of P(G) of G=Zp×Zp×Zp is given as:

H(P(G),y)=p2(p+1)(p1)2(1+p+p2)y2+p2(p1)(p2+p+1)y+p3.

Let Gx,y:xp2=yp=1,y1xy=xp+1. Then, for p2,

P(G)P(ZpZp2)P(Zp×Zp2)

(see [47] Theorem 3.5), and its Hosoya polynomial is given in Theorem 2. For p=2, P(G)P(Z2Z22)=K1(K3K¯4), then its Hosoya polynomial is

18y2+10y+8. (4)

Suppose Ga,b,c:ap=bp=cp=1,ac=cab,bc=cb,ab=ba. Then, for p=2,

P(G)P(Zp×Zp×Zp)P(Zp(Zp×Zp)),

and Theorem 3 specifies its Hosoya polynomial. For p=2,

P(G)P(Z2(Z2×Z2))P(Z2Z4),

and its Hosoya polynomial is given as in Equation (4).

Theorem 4.

The Hosoya polynomial of P(Zpqr) of Zpqr, where p,q,r are distinct primes is given as:

H(P(Zpqr),y)=(33p+p23q+3pqp2q+q2pq23r+3prp2r+3qr3pqr+p2qrq2r+pq2r+r2pr2qr2+pqr2)y2+12(p2q2r22p2qr+2p2q+2p2r2p22pq2r+2pq22pqr2+5pqr6pq+2pr26pr+6p+2q2r2q2+2qr26qr+6q2r2+6r6)y+pqr.

Proof. 

Since the node set Vk for any pair of nodes of P(Zpqr) is:

|Vk|=pqr2+pqr=pqr(pqr+1)2.

Clearly, C(P(Zpqr),0)=pqr. The structure of P(Zpqr) ([47]) is:

P(Zpqr)K(p1)(q1)(r1)+1C6[Kq1,Kqrpr+1,Kr1,Kprpr+1,Kp1,Kpqpq+1],

where C6 is the cycle of order 6. Using node partitions of P(Zpqr) as:

V(K(p1)(q1)(r1)+1)=A1,V(Kq1)=A2,V(Kqrqr+1)=A3,V(Kr1)=A4,
V(Kprpr+1)=A5,V(Kp1)=A6andV(Kpqpq+1)=A7.

Thus:

C(P(Zpqr),1)=(j,k);k,jA1andjk(j,k);jA1,kA2(j,k);jA1,kA3(j,k);jA1,kA4(j,k);jA1,kA5(j,k);jA1,kA6(j,k);jA1,kA7(j,k);j,kA2andjk(j,k);j,kA3andjk(j,k);j,kA4andjk(j,k);j,kA5andjk(j,k);j,kA6andjk(j,k);j,kA7andjk(j,k);jA2,kA3(j,k);jA3,kA4(j,k);jA4,kA5(j,k);jA5,kA6(j,k);jA6,kA7(j,k);jA7,kA2.

Therefore,

C(P(Zpqr),1)=1+(p1)(q1)(r1)2+1+(p1)(q1)(r1)(q1+qrrq+1+r1+prpr+1+p1+pqpq+1)+q12+r12+qrqr+12+prpr+12+p12+pqpq+12+(q+r2)(1+rqrq)+(1+rprp+1)(p+r2)+(1+qppq)(p+q2).=12(p2q2r22p2qr+2p2q+2p2r2p22pq2r+2pq22pqr2+5pqr6pq+2pr26pr+6p+2q2r2q2+2qr26qr+6q2r2+6r6).

In addition,

disP(Zpqr),2=|Vk|disP(Zpqr),0disP(Zpqr),1=pqr(pqr+1)2pqr12(p2q2r22p2qr+2p2q+2p2r2p22pq2r+2pq22pqr2+5pqr6pq+2pr26pr+6p+2q2r2q2+2qr26qr+6q2r2+6r6).=33p+p23q+3pqp2q+q2pq23r+3prp2r+3qr3pqr+p2qrq2r+pq2r+r2pr2qr2+pqr2.

By inserting the aforementioned values into Equation (1), we obtain the essential Hosoya polynomial. □

Next, we find the Hosoya polynomial of P(Zr×Fp,q),(p1(modq)). Similarly, the Hosoya polynomials of P(Zp×Fq,r),(q1(modr)) and P(Zq×Fp,r),(p1(modr)) can be obtained. The power graph of P(Zr×Fp,q),(p1(modq)) (see [47], Theorem 3.10) as a joined union is shown in Figure 1, where Kqrqr+1 and Kq1 both occur p-times.

Figure 1.

Figure 1

P(Zr×Fp,q),(p1(modq)).

Theorem 5.

The Hosoya polynomial of P(G) of the group G=Zr×Fp,q is given as:

H(P(G),y)=p2pq2r2pr2q2r2+2qr2q+r2y2+p2pr2+q2r23qr+2qr2y+pqr.

Proof. 

From Figure 1, consider the node partitions of P(G) as:

V(K1)={e},V(Kr1)=A1,V(Kprpr+1)=A2,V(Kr1)=A3,V(Kqrqr+1)=A4,andV(Kq1)=A5. Thus:

C(P(G),1)=(j,k);j=e,kA1(j,k);j=e,kA2(j,k);j=e,kA3j=1p(j,k);j=e,kA4j=1p(j,k);j=e,kA5(j,k);k,jA1,andkj(j,k);k,jA2,andkj(j,k);k,jA3andkj(j,k);k,jA3andkjj=1p(j,k);k,jA4andkjj=1p(j,k);k,jA5andkjj=1p(j,k);jA3,kA4j=1p(j,k);k,jA4,kA5.

From the above computation, we obtain:

C(P(G),1)=p1+rppr+1+r1+p(1+rqrq)+p(q1)+p12+prrp+12+r12+(rppr+1)(p+r2)+pq12+pqrqr+12+qpqp+12+(rqqr+1)(rp+qp2p)=12ppr2+q2r23qr+2qr2.

In addition,

disP(G),2=|Vk|disP(G),0disP(G),1=pqr(pqr+1)2pqr12ppr2+q2r23qr+2qr2=12ppq2r2pr2q2r2+2qr2q+r2.

Therefore, the Hosoya polynomial of P(G) is given as follows:

H(P(G),y)=p2pq2r2pr2q2r2+2qr2q+r2y2+p2pr2+q2r23qr+2qr2y+pqr.

Now, we examine the Hosoya polynomial of the power graph of Fp,qrp1(modqr). The structure of P(Fp,qr) is given in [47] (see Theorem 3.12). The following results can be proved in the same manner as Theorems 2 and 5.

Theorem 6.

Suppose GFp,qrp1(mod qr) is the group of order pqr. Then, the following characteristics hold true.

  •  (i) 
    For r=3 or q=3, the Hosoya polynomial of P(G) is given below:
    H(P(G),y)=12(p1)pq2r2pr2+2r2y2+12(p2r2+pq2r2pqrpr22pr+2p+2r2)y+pqr.
  •  (ii) 
    When r,q3, then the Hosoya polynomial of P(G) is given below:
    H(P(G),y)=12p(qr1)(qr+1)(p1)y2+12pp+q2r2qr1y+pqr.

The following result calculates the Hosoya polynomial of the power graph of Gi+5, and its proof is similar to the proof of the above results.

Theorem 7.

The following is the Hosoya polynomial of P(Gi+5):

H(P(Gi+5),y)=12p2q2r2p2q2pqr2+3pq2p2q+2y2+12(p2q2+pqr2pqr3pq+2p+2q2)y+pqr.

4. Reciprocal Status Hosoya Polynomials

The reciprocal status Hosoya polynomials of power graphs of finite groups pq and pqr will be determined in this section.

The first result establishes the reciprocal status Hosoya polynomials on the power graphs of cyclic and non-cyclic groups whose orders are the product of two different primes.

Theorem 8.

Suppose G is a finite group of order qp,(q>p). Then, the following characteristics hold true.

  •  (i) 
    If G is cyclic and |G|=pq, then
    Hrs(P(G),y)=(2+qpqp)(q1)y4pqq32+(q1)(2+qpqp)y4pqp32+(1+qpqp)(2+qpqp)2y2(pq1)+(p2)(p1)2y2pqq1+(p1)(p2)2y2pqp1.
  •  (ii) 
    If G is non-cyclic and |G|=pq, then
    Hrs(P(G),y)=(q1)y3pq+q42+q(p1)y4pq3q12+(q2)(q1)2ypq+q2+q(p2)(p1)2y2pq3q+1.

Proof. 

Using Lemma 1, the power graph of the cyclic group G is given below:

P(G)Kpqpq+2Kp1Kq1,

with node partition sets V(Kpqpq+2)=A1,V(Kp1)=A2 and V(Kq1)=A3. So, when vA1, then ec(v)=1; also, we use the reciprocal status idea, resulting in the following:

rs(v)=pq1.

When vA2, then ec(v)=2. Additionally, we use the reciprocal status idea, resulting in the following:

rs(v)=p2+qpqp+2+q12=2pqq12.

When vA3, implying ec(v)=2, further, we use the idea of reciprocal status, resulting in the following:

rs(v)=q2+pqpq+2+p12=2pqp12.

Clearly, from the structure of P(G), there are five distinct kinds of edges in P(G), namely: uv,uw,uu,vv and ww, where we take u=pq1,v=2pqq12 and w=2pqp12. Thus, using the reciprocal status Hosoya polynomial, we obtain:

Hrs(P(G),y)=Euvyu+v+Euwyu+w+Euuy2u+Evvy2v+Ewwy2w. (5)

In addition, the edge set of type uv is, Euv={abE(P(G)):rs(a)=u,rs(b)=v} and the order of Euv is |Euv|=(pqpq+2)(q1). Similarly, |Euu|=(2+qpqp)(1+qpqp)2,|Euw|=(2+qpqp)(q1),|Evv|=(p2)(p1)2, and |Eww|=(p2)(p1)2. Substituting all these values in Equation (5), we obtain:

Hrs(P(G),y)=(q1)(2+pqqp)y4pqq32+(pqpq+2)(q1)y4pqp32+(1+qpqp)(2+qpqp)2y2(pq1)+(p2)(p1)2y2pqq1+(p1)(p2)2y2pqp1.

(ii) By Lemma 1, P(G)K1Kp1Kp1qKq1, with V(K1)={e},V(Kp1)=A2 and V(Kq1)=A3.

So, when vV(K1), then ec(v)=1, and proceeding as in (i), we have:

rs(v)=pq1.

When vA2, then ec(v)=2, and using the idea of reciprocal status, resulting in the following:

rs(v)=q2+1+q(p1)2=pq+q22.

When vA3, implying ec(v)=2. Additionally, we incorporate the notion of reciprocal status, which results in the following:

rs(v)=q(p2)+1+q12=2pq3q+12.

Furthermore, from the structure of P(G), we see that there are four distinct kinds of edges, namely: uw,vv,uv, and ww, where we let u=pq1,v=pq+q22 and w=2pq3q+12. Therefore, by Equation (2), we have

Hrs(P(G),y)=Euvyu+v+Euwyu+w+Evvy2v+Ewwy2w. (6)

In addition, the cardinality of the corresponding edge sets is |Euv|=q1,|Euw|=q(p1),|Evv|=(q1)(q2)2, and |Eww|=q(p1)(p2)2. Putting these values in Equation (5), we obtain:

Hrs(P(G),y)=(q1)y3pq+q42+q(p1)y4pq3q12+(q2)(q1)2ypq+q2+q(p2)(p1)2y2pq3q+1.

Next, we calculate the reciprocal status Hosoya polynomials of all those groups whose order is p3.

Theorem 9.

Assume that P(G) is the power graph of G=Zp×Zp2 order p3. Then

Hrs(P(G),y)=(p1)y4p3p2+p42+p(p2p)y4p3+p242+p(p1)y2p3+p2+p42+p12yp3+p22+p(p1)(p2p)y3p3+p42+pp2p2yp3+p22+pp12yp2+p2.

Proof. 

Using the node partitions of P(G) as given in Theorem 2 and V(K1)={e}, we have: For v=e, then ec(v)=1. Additionally, we use the idea of reciprocal status, resulting in the following:

rs(v)=p(p1)+p1+p(p2p)=p31.

For vA1, ec(v)=2. Additionally, we incorporate the notion of reciprocal status, which results in the following:

rs(v)=p(p1)2+(p1)+p(p2p)=2p3p2+p22.

When vA2, then ec(v)=2. Furthermore, we incorporate the notion of reciprocal status, which results in the following:

rs(v)=p2p1+1+p1+12p(p1)+(p2p)(p1)=p3+p222.

When vA3, then ec(v)=2. Furthermore, using the idea of reciprocal status results in the following:

rs(v)=(p1)+12(p1)2+p(p2p)+p1=p3+p22.

From the structure of P(G), we see that there are six kinds of edges in P(G), namely: uv,uw,ux,vv,vw,ww and xx, where we take u=p31,v=2p3p2+p22,w=p3+p222, and x=p2+p22. Therefore,

Hrs(P(G),y)=Euvyu+v+Euwyu+w+Euuy2u+Evvy2v+Ewwy2w. (7)

In addition, the edge set of type uv is Euv={abE(P(G)):rs(a)=u,rs(b)=v} and the order of Euv is |Euv|=p1. Similarly, |Euw|=p(p2p),|Eux|=p(p1),|Evv|=p12,|Evw|=p(p1)(p2p),|Eww|=pp2p2, and |Exx|=pp12. Substituting all these values in Equation (7), we have:

Hrs(P(G),y)=(p1)y4p3p2+p42+p(p2p)y4p3+p242+p(p1)y2p3+p2+p42+p12yp3+p22+p(p1)(p2p)y3p3+p42+pp2p2yp3+p22+pp12yp2+p2.

We obtain the following result by performing the processes described in Theorem 9.

Theorem 10.

Consider P(G) is the power graph of G=Zp×Zp×Zp of order p3. Then

Hrs(P(G),y)=(p31)y3p3+p42+(p2+p+1)p12yp3+p2.

Let Gx,y:xp2=yp=1,y1xy=xp+1. Then, for p2, P(G)P(ZpZp2)P(Zp×Zp2) and its reciprocal status Hosoya polynomial is given in Theorem 9. For p=2, P(G)P(Z2Z22)=K1(K3K¯4), then its Hosoya polynomial is

4y11+3y10+3y9. (8)

Suppose Ga,b,c:ap=bp=cp=1,ac=cab,bc=cb,ab=ba. Then, for p2, P(G)P(Zp×Zp×Zp)P(Zp(Zp×Zp)) and its reciprocal status Hosoya polynomial is devoted in Theorem 10. When p=2, then P(G)P(Z2(Z2×Z2))P(Z2Z4), and its reciprocal status is given by Equation (8).

The following result gives the power graph’s reciprocal status Hosoya polynomials of the cyclic group Zpqr.

Theorem 11.

Assume that P(Zpqr) is the power graph of Zpqr of order pqr. Then

Hrs(P(Zpqr),y)=1+prrp2y2u1+(q1)((p1)(q1)(r1)+1)yu1+u2+(1+rqrq)(1+(p1)(q1)(r1))yu1+u3+(r1)((p1)(q1)(r1)+1)yu1+u4+(1+prrp)((q1)(p1)(r1)+1)yu1+u5+(p1)(1+(r1)(q1)(p1))yu1+u6+(p1)(1+(r1)(q1)(p1))yu1+u7+q12y2u2+(q1)(qrqr+1)yu2+u3+(q1)(pqpq+1)yu2+u7+1+rqrq2y2u3+(r1)(1+rqrq)yu3+u4+r12y2u4+(r1)(rppr+1)yu4+u5+1+prrp2y2u5+(p1)(1+prrp)yu5+u6+p12y2u6+(p1)(1+pqqp)yu6+u7+1+pqqp2y2u7,

where u1=pqr1,u2=2pqrpr12,u3=2pqrprpq+p+q+r+12,u4=2pqrpq12,u5=12(2pqrpqqr+p+q+r3),u6=2pqrqr12 and u7=2pqrprqr+p+q+r32.

Proof. 

Using the node partitions of P(Zpqr) as presented in Theorem 4, we obtain the following:

When, u1A1, implying ec(u1)=1, also, we use the reciprocal status concept, which results in the following:

rs(u1)=pqr1.

When, u2A2, then ec(u2)=2. Furthermore, we incorporate the concept of reciprocal status, which results in the following:

rs(u2)=q2+qrpqprqrp+q+p+r1+1+rqqr+1+qpqp+1+12p1+prpr+1+r1=2pqrpr12.

When u3A3, then ec(u3)=2; also, we use the reciprocal status concept, which results in the following:

rs(u3)=qrqr+q1+r1+qrprqrpqp+r+q+p+12prpr+1+p1+pqpq+1=2pqrprpq+p+q+r+12.

When u4A4, it implies ec(u4)=2. Furthermore, we incorporate the concept of reciprocal status, which results in the following:

rs(u4)=2pqrpq12.

When u5A5, then ec(u5)=2; furthermore, we use the idea of reciprocal status, resulting in the following:

rs(u5)=2pqrpqqr+p+q+r32.

When u6A6, then ec(u6)=2; also, we use the reciprocal status concept, which results in the following:

rs(u6)=2pqrqr12.

When u7A7, it implies ec(u7)=2; also, we use the idea of reciprocal status, resulting in the following:

rs(u7)=2pqrprqr+p+q+r32.

From the structure of P(Zpqr), we see that there are 19 types of edges in P(Zpqr) such as: u1ui, for i=1,2,3,4,5,6,7,u2ui, for i=2,3,4, u3ui, for i=3,4, u4ui, for i=4,5, u5ui, for i=5,6, uiu6, for i=6,7, and u7u7, where all ui values are as assigned above. Therefore,

Hrs(P(Zpqr))=Eu1u1y2u1+Eu1u2yu1+u2+Eu1u3yu1+u3+Eu1u4yu1+u4+Eu1u5yu1+u5+Eu1u6yu1+u6+Eu1u7yu1+u7+Eu2u2y2u2+Eu2u3yu2+u3+Eu2u7yu2+u7+Eu3u3y2u3+Eu3u4yu3+u4+Eu4u4y2u4+Eu4u5yu4+u5+Eu5u5y2u5+Eu5u6yu5+u6+Eu6u6y2u6+Eu6u7yu6+u7+Eu7u7y2u7. (9)

Moreover, the cardinality of Eu1u1 is prpr+12. Similarly, we have:

|Eu1u2|=(q1)(1+(r1)(q1)(p1)),|Eu2u2|=q12,|Eu3u3|=qrqr+12|Eu1u3|=(qrqr+1)(1+(r1)(q1)(p1)),|Eu2u3|=(q1)(1+rqrq)|Eu1u4|=(r1)((p1)(q1)(r1)+1),|Eu2u7|=(q1)(pqpq+1)|Eu1u5|=(prpr+1)((p1)(q1)(r1)+1),|Eu3u4|=(r1)(1+rqrq)|Eu1u6|=(p1)(1+(p1)(q1)(r1)),|Eu1u7|=(p1)((p1)(q1)(r1)+1),|Eu4u4|=r12,|Eu4u5|=(r1)(1+rprp),|Eu5u5|=1+prrp2,|Eu5u6|=(p1)(prpr+1),|Eu6u6|=p12,|Eu6u7|=(p1)(1+qpqp),|Eu7u7|=1+qpqp2.

Putting all these values in Equation (9), we obtain the required reciprocal status Hosoya polynomial. □

Theorem 12.

Suppose P(G) is the power graph of G=Zr×Fp,q of order pqr. Then

Hrs(P(G),y)=(p1)yu1+u2+(prpr+1)yu1+u3+(r1)yu1+u4+p(qrqr+1)yu1+u5+p(q1)yu1+u6+q12y2u2+(1+prrp)(p1)yu2+u3+r12y2u4+1+prrp2y2u3+(r1)(1+prrp)yu3+u4+1+qrrq2y2u5+p(r1)(1+qrrq)yu4+u5+p(q1)(qrqr+1)yu5+u6+q12y2u6,

where u1=pqr1,u2=12(pqr+prr1),u3=12(pqr+pr2),u4=12(2pqrpq1),u5=12(pqr+qr2), and u6=12(pqr+qrr1).

Proof. 

We obtain the following from Figure 1 and the partitions defined in Theorem 5:

When the node u1=e, then ec(u1)=1; furthermore, we incorporate the concept of reciprocal status, which results in the following:

rs(u1)=pqr1.

When u2A2, it implies ec(u2)=2; also, we incorporate the concept of reciprocal status, which results in the following:

rs(u2)=12+p(q1)+(r1)+p(1+qrrq)+p2+1+prpr+1=12(pqr+prr1).

When u3A3, then ec(u3)=2; also, we use the reciprocal status concept, which results in the following:

rs(u3)=12(2pqrpq1).

When u4A4, it implies ec(u4)=2; further, we incorporate the concept of reciprocal status, which results in the following:

rs(u4)=12(pqr+qr2).

When u5A5, then ec(u5)=2; additionally, we incorporate the concept of reciprocal status, which results in the following:

rs(u5)=12(pqr+qrr1).

From the structure of P(G), we see that there are 14 kinds of edges in P(G), such as: u1ui, for i=2,3,4,5,6,u2ui, for i=2,3, u3ui, for i=3,4, u4ui, for i=4,5, u5ui, for i=5,6, u6u6, where ui values are assigned as above. Therefore:

Hrs(P(G),y)=Eu1u2yu1+u2+Eu1u3yu1+u3+Eu1u4yu1+u4+Eu1u5yu1+u5+Eu1u6yu1+u6+Eu2u2y2u2+Eu2u3yu2+u3+Eu3u3y2u3+Eu3u4yu3+u4+Eu4u4y2u4+Eu4u5yu4+u5+Eu5u5y2u5+Eu5u6yu5+u6+Eu6u6y2u6. (10)

Now, the cardinality of Euv values are

|Eu1u2|=p1,|Eu1u3|=prpr+1,|Eu1u4|=r1,|Eu1u5|=p(qrqr+1),|Eu1u6|=p(q1),|Eu2u2|=q12,|Eu2u3|=(p1)(1+prrp),|Eu3u3|=1+prrp2,|Eu3u4|=(r1)(1+prrp),|Eu4u4|=r12,|Eu4u5|=p(1+qrrq)(r1),|Eu5u5|=1+qrqr2|Eu5u6|=p(1+qrrq)(q1),|Eu6u6|=q12.

Putting all these values in Equation (10), we obtain the required result. □

Following the procedure as used in the above theorems, we obtain the following results.

Theorem 13.

Let P(Fp,qr), where r=3 or q=3 is a power graph of Fp,qr of order pqr. Then

Hrs(P(Fp,qr),y)=(p1)yu1+u2+(prpr+1)yu1+u3+(r1)yu1+u4+p(qrr)yu1+u5+p12y2u2+(p1)(1+prrp)yu2+u3+1+prrp2y2u3+(r1)(1+prrp)yu3+u4+r12y2u4+p(qrr)(r1)yu4+u5+pqrr2y2u5.

where u1=pqr1,u2=12(pqr+prr1),u3=12(pqr+pr2),u4=12(2pqr2r+p1), and u5=12(pqr+qr2).

Theorem 14.

Suppose P(Fp,qr) is the power graph of Fp,qr of order pqr. Then

Hrs(P(Fp,qr),y)=(p1)yu1+u2+p(qr1)yu1+u3+p12y2u2+pqr12y2u3,

where u1=pqr1,u2=12(pqr+p2), and u3=12(pqr+qr2).

Theorem 15.

Let P(Gi+5) be the power graph of a group Gi+5 of order pqr. Then

Hrs(Gi+5,y)=(p1)yu1+u2+(prpr+1)yu1+u3+(q1)yu1+u4+pq(r1)yu1+u5+p12y2u2+(p1)(1+prrp)yu2+u3+1+prrp2y2u3+(q1)(1+pqqp)yu3+u4+q12y2u4+pqr12y2u5.

where u1=pqr1,u2=12(pqr+pqq1),u3=12(pqr+pq2),u4=12(pqr+pqp1), and u5=12(pqr+r2).

5. Conclusions

The main objective of this article was to examine the structural characteristics of the power graphs of finite abelian and non-abelian groups. In general, finding the (reciprocal status) Hosoya polynomials of graphs is very difficult. The researchers try to study the same for different classes of graphs. The (reciprocal status) Hosoya polynomials of graphs defined on algebraic structures have attracted the attention of researchers. In this paper, we made a little effort and discussed the Hosoya polynomials as well as the reciprocal status Hosoya polynomials of the power graphs associated with finite groups of order pq and pqr.

However, the (reciprocal status) Hosoya polynomials for general power graphs are open and remain a challenge. In chemistry, an algebraic structure is critical for forming chemical structures and investigating the different chemical characteristics of chemical compounds included inside these structures.

Acknowledgments

The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work under grant code: 22UQU4310396DSR24.

Author Contributions

Conceptualization, B.A.R., F.A., and M.N.; software, B.A.R., F.A., M.N.; writing—original draft preparation, B.A.R., F.A.; writing—review and editing, F.A., B.A.R., S.A., and M.N.; formal analysis, M.N., F.A., and B.A.R.; validation, F.A., M.N., and S.A.; methodology, B.A.R., F.A., and S.A.; investigation, B.A.R., F.A., and M.N.; resources, B.A.R., F.A., and S.A.; project administration, B.A.R. and F.A.; funding acquisition, S.A., M.N. All authors have read and agreed to the final version of the manuscript.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

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

Conflicts of Interest

The authors declare no conflict of interest.

Sample Availability

Samples of the compounds are not available from the authors.

Funding Statement

This research received no external funding.

Footnotes

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Mirzargar M., Ashrafi A.R. Some distance-based topological indices of a non-commuting graph. Hacet. J. Math. Stat. 2012;41:515–526. [Google Scholar]
  • 2.Wiener H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947;69:17–20. doi: 10.1021/ja01193a005. [DOI] [PubMed] [Google Scholar]
  • 3.Ali F., Rather B.A., Din A., Saeed T., Ullah A. Power graphs of finite groups determined by Hosoya properties. Entropy. 2022;24:213. doi: 10.3390/e24020213. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 4.Caporossi G., Gutman I., Hansen P., Pavlović L. Graphs with maximum connectivity index. Comput. Biol. Chem. 2003;27:85–90. doi: 10.1016/S0097-8485(02)00016-5. [DOI] [Google Scholar]
  • 5.Graovac A., Ghorbani M., Hosseinzadeh M.A. Computing fifth geometric-arithmetic index for nanostar dendrimers. J. Math. Nanosci. 2011;1:33–42. [Google Scholar]
  • 6.Hayat S., Wang S., Liu J.B. Valency-based topological descriptors of chemical networks and their applications. Appl. Math. Model. 2018;60:164–178. doi: 10.1016/j.apm.2018.03.016. [DOI] [Google Scholar]
  • 7.Hayat S., Imran M., Liu J.B. An efficient computational technique for degree and distance based topological descriptors with applications. IEEE Access. 2019;7:32276–32296. doi: 10.1109/ACCESS.2019.2900500. [DOI] [Google Scholar]
  • 8.Pólya G. Kombinatorische anzahlbestimmungen für gruppen, graphen und chemische verbindungen. Acta Math. 1937;68:145–254. doi: 10.1007/BF02546665. [DOI] [Google Scholar]
  • 9.Hosoya H. On some counting polynomials in chemistry. DIscrete Appl. Math. 1988;19:239–257. doi: 10.1016/0166-218X(88)90017-0. [DOI] [Google Scholar]
  • 10.Sagan B.E., Yeh Y.N., Zhang P. The Wiener polynomial of a graph. Int. J. Quantum Chem. 1996;60:959–969. doi: 10.1002/(SICI)1097-461X(1996)60:5&#x0003c;959::AID-QUA2&#x0003e;3.0.CO;2-W. [DOI] [Google Scholar]
  • 11.Cash G.G. Relationship between the Hosoya polynomial and the hyper-Wiener index. Appl. Math. Lett. 2002;15:893–895. doi: 10.1016/S0893-9659(02)00059-9. [DOI] [Google Scholar]
  • 12.Estrada E., Ivanciuc O., Gutman I., Gutierrez A., Rodríguez L. Extended Wiener indices. A new set of descriptors for quantitative structure-property studies. New J. Chem. 1998;22:819–822. doi: 10.1039/a709255e. [DOI] [Google Scholar]
  • 13.Kelarev A., Quinn S. Directed graphs and combinatorial properties of semigroups. J. Algebra. 2002;251:16–26. doi: 10.1006/jabr.2001.9128. [DOI] [Google Scholar]
  • 14.Chattopadhyay S., Panigrahi P. On Laplacian spectrum of power graphs of finite cyclic and dihedral groups. Linear Multilinear Algebra. 2015;63:1345–1355. doi: 10.1080/03081087.2014.936435. [DOI] [Google Scholar]
  • 15.Cameron P.J., Swathi V., Sunitha M. Matching in power graphs of finite groups. arXiv. 2021 doi: 10.1007/s00026-022-00576-5.2107.01157 [DOI] [Google Scholar]
  • 16.Ma X., Feng M., Wang K. The power index of a graph. Graphs Comb. 2017;33:1381–1391. doi: 10.1007/s00373-017-1851-y. [DOI] [Google Scholar]
  • 17.Curtin B., Pourgholi G.R. Edge-maximality of power graphs of finite cyclic groups. J. Algebr. Comb. 2014;40:313–330. doi: 10.1007/s10801-013-0490-5. [DOI] [Google Scholar]
  • 18.Chattopadhyay S., Patra K.L., Sahoo B.K. Vertex connectivity of the power graph of a finite cyclic group. Discret. Appl. Math. 2019;266:259–271. doi: 10.1016/j.dam.2018.06.001. [DOI] [Google Scholar]
  • 19.Ali F., Li Y. The connectivity and the spectral radius of commuting graphs on certain finite groups. Linear Multilinear Algebra. 2021;69:2945–2958. doi: 10.1080/03081087.2019.1700893. [DOI] [Google Scholar]
  • 20.Rather B.A., Ali F., Ullah N., Mohammad A.-S., Din A., Sehra Aα matrix of commuting graphs of non-abelian groups. AIMS Math. 2022;7:15436–15452. doi: 10.3934/math.2022845. [DOI] [Google Scholar]
  • 21.Ali F., Fatima S., Wang W. On the power graphs of certain finite groups. Linear Multilinear Algebra. 2020:1–15. doi: 10.1080/03081087.2020.1856028. [DOI] [Google Scholar]
  • 22.Rather B.A., Aijaz M., Ali F., Ullah A. On distance signless Laplacian eigenvalues of zero divisor graph of commutative rings. AIMS Math. 2022;7:12635–12649. doi: 10.3934/math.2022699. [DOI] [Google Scholar]
  • 23.Hayat U., de Celis Á.N., Ali F. Commuting graphs on coxeter groups, Dynkin diagrams and finite subgroups of SL(2,ℂ) arXiv. 20171703.02480 [Google Scholar]
  • 24.Ali F., Rather B.A., Fatima N., Sarfraz M., Ullah A., Alharbi K.A.M., Dad R. On the topological indices of commuting graphs for finite non-Abelian groups. Symmetry. 2022;14:1266. doi: 10.3390/sym14061266. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 25.Liu J.B., Zhang T., Wang Y., Lin W. The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain. Discret. Appl. Math. 2022;307:22–31. doi: 10.1016/j.dam.2021.10.004. [DOI] [Google Scholar]
  • 26.Jauhari M., Ali F. Survey on topological indices and graphs associated with a commutative ring. J. Phys. Conf. Ser. 2020;1562:012008. [Google Scholar]
  • 27.Rather B.A., Ali F., Ullah A., Fatima N., Dad R. Aγ eigenvalues of zero divisor graph of integer modulo and Von Neumann regular rings. Symmetry. 2022;14:1710. doi: 10.3390/sym14081710. [DOI] [Google Scholar]
  • 28.Hosoya H. Topological index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bull. Chem. Soc. Jpn. 1971;44:2332–2339. doi: 10.1246/bcsj.44.2332. [DOI] [Google Scholar]
  • 29.Hosoya H. Topological index as a common tool for quantum chemistry, statistical mechanics, and graph theory. Math. Comput. Concepts Chem. 1986:110–123. [Google Scholar]
  • 30.Deng H., Chen S. The extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index. MATCH Commun. Math. Comput. Chem. 2008;59:171–190. [Google Scholar]
  • 31.Wagner S. Extremal trees with respect to Hosoya index and Merrifield-Simmons index. MATCH Commun. Math. Comput. Chem. 2007;57:221–233. [Google Scholar]
  • 32.Yu A., Tian F. A kind of graphs with minimal Hosoya indices and maximal Merrifield-Simmons indices. MATCH Commun. Math. Comput. Chem. 2006;55:103–118. [Google Scholar]
  • 33.Liu J.B., Zhao J., He H., Shao Z. Valency-based topological descriptors and structural property of the generalized sierpiński networks. J. Stat. Phys. 2019;177:1131–1147. doi: 10.1007/s10955-019-02412-2. [DOI] [Google Scholar]
  • 34.Liu J.B., Wang C., Wang S., Wei B. Zagreb indices and multiplicative Zagreb indices of Eulerian graphs. Bull. Malays. Math. Sci. Soc. 2019;42:67–78. doi: 10.1007/s40840-017-0463-2. [DOI] [Google Scholar]
  • 35.Liu J.B., Pan X.F. Minimizing Kirchhoff index among graphs with a given vertex bipartiteness. Appl. Math. Comput. 2016;291:84–88. doi: 10.1016/j.amc.2016.06.017. [DOI] [Google Scholar]
  • 36.Salman M., Noreen T., Rehman M.U., Cao J., Abbas M.Z. Non-commuting graph of the dihedral group determined by Hosoya parameters. Alex. Eng. J. 2022;61:3709–3717. doi: 10.1016/j.aej.2021.09.008. [DOI] [Google Scholar]
  • 37.Ali F., Rather B.A., Sarfraz M., Ullah A., Fatima N., Mashwani W.K. Certain topological indices of non-commuting graphs for finite non-abelian groups. Molecules. 2022;27:6053. doi: 10.3390/molecules27186053. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 38.Liu J.B., Zhao J., Min J., Cao J. The Hosoya index of graphs formed by a fractal graph. Fractals. 2019;27:1950135. doi: 10.1142/S0218348X19501354. [DOI] [Google Scholar]
  • 39.Mphako-Banda E., Ncambalala T. Hosoya polynomial of the subdivided join. Kuwait J. Sci. 2019;46:7–12. [Google Scholar]
  • 40.Ramane H.S., Talwar S.Y. Reciprocal transmission Hosoya polynomial of graphs. Math. Comb. 2019;3:70–79. [Google Scholar]
  • 41.Brouwer A.E., Haemers W.H. Spectra of Graphs. Springer Science & Business Media; New York, NY, USA: 2011. [Google Scholar]
  • 42.Derek J.R., Robinson S. A course in the theory of groups. Grad. Texts Math. 1996;80:21–22. [Google Scholar]
  • 43.Dummit D.S., Foote R.M. Abstract Algebra. 3rd ed. Jhon Wiley & Sons, Inc.; Hoboken, NJ, USA: 2004. [Google Scholar]
  • 44.Tamizh Chelvam T., Sattanathan M. Power graph of finite abelian groups. Algebra Discret. Math. 2013;16:33–41. [Google Scholar]
  • 45.Hölder O. Die Gruppen der Ordnungen p3,pq2,pqr,p4. Math. Ann. 1893;43:301–412. doi: 10.1007/BF01443651. [DOI] [Google Scholar]
  • 46.Ghorbani M., Abbasi-Barfaraz F. On the characteristic polynomial of power graphs. Filomat. 2018;32:4375–4387. doi: 10.2298/FIL1812375G. [DOI] [Google Scholar]
  • 47.Ghorbani M., Nowroozi Larki F. Automorphism group of groups of order pqr. Algebr. Struct. Their Appl. 2014;1:49–56. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

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


Articles from Molecules are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES