Abstract
Assume that is a finite group. The power graph of is a graph in which 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 and , where and 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 is a finite group. The power graph of is a graph whose node set is 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 of a semigroup and defined the class of semigroups whose power graphs are complete. Additionally, they explained when the power graph of a group is complete whenever the group 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 , 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 of an arbitrary group 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 and , whereas and are different primes. Section 4 analyzes the reciprocal status Hosoya polynomial of power graphs of finite groups of order and 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 and , respectively. The distance from to in symbolized by 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 and are connected if they share an edge, and it is represented by ; otherwise, The degree or valency of a node is , which represents the set of nodes in that are edge connected to . A path having length is known as a geodesic. The greatest distance between and other nodes in is referred to as the eccentricity and is indicated by the symbol . The diameter denoted by of is the greatest eccentricity amongst all the nodes of Additionally, the radius denoted by is the least eccentricity of all the nodes in
Assume that is a connected graph of degree Hosoya defines the polynomial of as given below:
| (1) |
The coefficient denotes the total of pairs of nodes such that where . In [40], the authors presented the following reciprocal status Hosoya polynomial for :
| (2) |
where is called the reciprocal status or the reciprocal transmission of w.
Assume that and are two graphs that are connected; then, is the join of and where the node and edge sets are and
respectively. An edge connecting any two nodes in a graph is known as a complete graph, and it is represented by . Additional undefined terms and notations were obtained from [41,42].
We denote the cyclic group of order n by . In addition, the direct product of groups having binary operations , respectively, is the collection of all ordered n-tuples component-wise operation defined by
where is the product in 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 .
Lemma 1
([44]). Assume that is a finite group and whereas p and q are primes. Then, the subsequent properties hold.
- (i)
if and only if is cyclic.
- (ii)
if and only if is non-cyclic.
Next, the following result provides the Hosoya polynomial of power graphs of a finite group of order
Theorem 1.
Suppose is a finite group and . Then, the subsequent holds.
- (i)
If is cyclic of order , then
- (ii)
If is non-cyclic of order , then
Proof.
By the definition of Hosoya coefficients given in Equation (1), we need to determine , and . Consider now a node set that contains any pair of nodes; then,
Suppose
and Then:
(3) Since, for each , so
and is equal to Therefore, Applying (i) of Lemma 1, we have with and Therefore,
Consequently,
Using Equation (3), we obtain:
Hence,
Now, by Equation (1) and using the above calculation, we obtain
(ii) Using Lemma 1, the power graph of is Let and retaining other notation as given in , we obtain:
Thereby, it follows that
Using Equation (3), we obtain
Thus, the Hosoya polynomial of is given below:
□
We denote as the class of all finite groups whose order is , whereas are primes. Hölder [45] (see, also [46]) investigated the structures of groups in . For , there are five groups of order that are given as:
where ⋊ is the semidirect product and × is the direct product of groups. For , the groups of order are given below:
where , in and in
Suppose for we have following groups of order for
where in and in
where in and in
Based on these finite groups of order , we find the Hosoya polynomials of their power graphs.
Theorem 2.
The Hosoya polynomial of of the group is given as:
Proof.
First, we find the Hosoya coefficients, , and of . The node set for any pair of nodes of is given below:
Clearly, In addition, the structure of ( see [47]) is given as:
Suppose and denote one of the remaining p copies of nodes of by . Thus:
Consequently,
Therefore, from
we obtain
By using the above values in Equation (1), we obtain
□
Proceeding in the same manner as in Theorem 2 and noticing that (see [47]) , we have the following result for the power graph of
Theorem 3.
The Hosoya polynomial of of is given as:
Let Then, for ,
(see [47] Theorem 3.5), and its Hosoya polynomial is given in Theorem 2. For , then its Hosoya polynomial is
| (4) |
Suppose Then, for ,
and Theorem 3 specifies its Hosoya polynomial. For ,
and its Hosoya polynomial is given as in Equation (4).
Theorem 4.
The Hosoya polynomial of of , where are distinct primes is given as:
Proof.
Since the node set for any pair of nodes of is:
Clearly, The structure of ([47]) is:
where is the cycle of order Using node partitions of as:
Thus:
Therefore,
In addition,
By inserting the aforementioned values into Equation (1), we obtain the essential Hosoya polynomial. □
Next, we find the Hosoya polynomial of . Similarly, the Hosoya polynomials of and can be obtained. The power graph of (see [47], Theorem 3.10) as a joined union is shown in Figure 1, where and both occur p-times.
Figure 1.
.
Theorem 5.
The Hosoya polynomial of of the group is given as:
Proof.
From Figure 1, consider the node partitions of as:
Thus:
From the above computation, we obtain:
In addition,
Therefore, the Hosoya polynomial of is given as follows:
□
Now, we examine the Hosoya polynomial of the power graph of The structure of 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 is the group of order . Then, the following characteristics hold true.
- (i)
For or the Hosoya polynomial of is given below:
- (ii)
When , then the Hosoya polynomial of is given below:
The following result calculates the Hosoya polynomial of the power graph of , and its proof is similar to the proof of the above results.
Theorem 7.
The following is the Hosoya polynomial of :
4. Reciprocal Status Hosoya Polynomials
The reciprocal status Hosoya polynomials of power graphs of finite groups and 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 is a finite group of order . Then, the following characteristics hold true.
- (i)
If is cyclic and , then
- (ii)
If is non-cyclic and , then
Proof.
Using Lemma 1, the power graph of the cyclic group is given below:
with node partition sets and . So, when , then ; also, we use the reciprocal status idea, resulting in the following:
When , then Additionally, we use the reciprocal status idea, resulting in the following:
When , implying further, we use the idea of reciprocal status, resulting in the following:
Clearly, from the structure of , there are five distinct kinds of edges in , namely: and , where we take and Thus, using the reciprocal status Hosoya polynomial, we obtain:
(5) In addition, the edge set of type is, and the order of is Similarly, and Substituting all these values in Equation (5), we obtain:
By Lemma 1, with and .
So, when , then , and proceeding as in , we have:
When , then and using the idea of reciprocal status, resulting in the following:
When , implying Additionally, we incorporate the notion of reciprocal status, which results in the following:
Furthermore, from the structure of , we see that there are four distinct kinds of edges, namely: and , where we let and Therefore, by Equation (2), we have
(6) In addition, the cardinality of the corresponding edge sets is and Putting these values in Equation (5), we obtain:
□
Next, we calculate the reciprocal status Hosoya polynomials of all those groups whose order is .
Theorem 9.
Assume that is the power graph of order Then
Proof.
Using the node partitions of as given in Theorem 2 and , we have: For , then . Additionally, we use the idea of reciprocal status, resulting in the following:
For , Additionally, we incorporate the notion of reciprocal status, which results in the following:
When , then Furthermore, we incorporate the notion of reciprocal status, which results in the following:
When , then Furthermore, using the idea of reciprocal status results in the following:
From the structure of , we see that there are six kinds of edges in , namely: and , where we take and Therefore,
(7) In addition, the edge set of type is and the order of is Similarly, and Substituting all these values in Equation (7), we have:
□
We obtain the following result by performing the processes described in Theorem 9.
Theorem 10.
Consider is the power graph of of order Then
Let Then, for , and its reciprocal status Hosoya polynomial is given in Theorem 9. For , , then its Hosoya polynomial is
| (8) |
Suppose Then, for , and its reciprocal status Hosoya polynomial is devoted in Theorem 10. When , then , 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
Theorem 11.
Assume that is the power graph of of order Then
where and
Proof.
Using the node partitions of as presented in Theorem 4, we obtain the following:
When, , implying , also, we use the reciprocal status concept, which results in the following:
When, , then Furthermore, we incorporate the concept of reciprocal status, which results in the following:
When , then also, we use the reciprocal status concept, which results in the following:
When , it implies Furthermore, we incorporate the concept of reciprocal status, which results in the following:
When , then furthermore, we use the idea of reciprocal status, resulting in the following:
When , then also, we use the reciprocal status concept, which results in the following:
When , it implies also, we use the idea of reciprocal status, resulting in the following:
From the structure of , we see that there are 19 types of edges in such as: for for , for , for , for , , for , and , where all values are as assigned above. Therefore,
(9) Moreover, the cardinality of is Similarly, we have:
Putting all these values in Equation (9), we obtain the required reciprocal status Hosoya polynomial. □
Theorem 12.
Suppose is the power graph of of order Then
where and .
Proof.
We obtain the following from Figure 1 and the partitions defined in Theorem 5:
When the node , then ; furthermore, we incorporate the concept of reciprocal status, which results in the following:
When , it implies also, we incorporate the concept of reciprocal status, which results in the following:
When , then also, we use the reciprocal status concept, which results in the following:
When , it implies further, we incorporate the concept of reciprocal status, which results in the following:
When , then additionally, we incorporate the concept of reciprocal status, which results in the following:
From the structure of , we see that there are 14 kinds of edges in , such as: for for , for , for , for , , where values are assigned as above. Therefore:
(10) Now, the cardinality of values are
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 where or is a power graph of of order Then
where and .
Theorem 14.
Suppose is the power graph of of order Then
where and
Theorem 15.
Let be the power graph of a group of order Then
where and .
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 and
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<959::AID-QUA2>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.

