Abstract
Several topological indices are known to have widespread implications in a variety of research areas. Over the years, the Kirchhoff index has turned out to be an extremely significant and efficient index. In this paper, we propose the exact formulas for the expected values of the random polyomino chain to construct the multiplicative degree-Kirchhoff index and the additive degree-Kirchhoff index. We also carefully examine the highest degree of the expected values for a random polyomino chain through the multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index.
1. Introduction
Resistance distance is regarded as the distance graph function, which is essential for random walk of the graph and the spring network. Based on the idea of electrical networks, Klein and Randić [] proposed the notion of the Kirchhoff index and resistance distance of graphs in 1993. Suppose as a symmetric graph with the vertex set and the corresponding electrical network is obtained when each edge of the graph is replaced by a fixed resistance (unit resistance). For a graph , the resistance distance between any two vertices is denoted by , where . However, in electrical networks, the resistance distance is known as effective resistance between nodes. The effective resistance can be calculated from Kirchhoff’s circuit laws and Ohm’s laws. The sum of all pairs of vertices of resistance distances is known as the Kirchhoff index of , represented as , and written as
where
Chen and Zhang [] introduced a modern graph invariant in 2007, which is stated as
where indicates the vertex’s degree of the graph .
Gutman et al. [] introduced the idea of the additive degree-Kirchhoff index in 2012, defined as
Many studies have been carried out to compute Kirchhoff indices for specific classes of graphs, to find bounds for the Kirchhoff indices of graphs, and to find the characteristic extremal graphs [,,,,,,]. Recently, a study has been made to explore the Kirchhoff index based on the degree of vertices regarding irregular polygonal chains. These efforts led to the expected values of the degree-Kirchhoff indices (both additive and multiplicative), Gutman index, and Schultz index of a random polyphenylene chain being obtained []. For extended studies on random polygonal chains, mostly readers referred to the recent papers [,,,]. The motivation of the purposed study can be elaborated as:
- Some scholars study the calculation methods of degree-Kirchhoff index for some special classes of graphs such as linear hexagonal chain, hexagonal chain, ladder diagram, ladder chain, linear polynomial chain, linear hexagon chain, and so on. This work was still unattended for a random polyomino chain.
- In [], the authors have established a beautiful relation between the multiplicative degree-Kirchhoff index and the eigenvalues of the normalized Laplacian matrix.
Inspired by the above literature, this paper is dedicated to establish the exact formulas for the expected values of the additive and multiplicative degree-Kirchhoff indices via a random polyomino chain. Moreover, the highest degree of the expected values of these indices is also characterized.
The graph of polyominoes [] (also known as chessboards [] or arrangements that use square cells []) is a symmetrical geometric graph that is attained when two congruent ordinary squares (have either a common edge or are disjoint) with sides of distance 1 (known as a cell) are arranged in a plane. Polyomino graphs have numerous applications in structural chemistry and statistical physics. An irregular polyomino chain is known as a subgraph of a polyomino graph []. A polyomino chain having “” squares, that is to be considered as a polyomino chain having “” squares adjacent to a indicated in picture, a new terminal square by a cut edge as shown in Figure 1.
Figure 1.
A polyomino chain with squares.
If is a polyomino chain having squares, as the th square of connected to with a cut edge , where , . A vertex is known as ortho-vertex and para-vertex of if the distance between and is one and two, respectively. It is easy to establish that , , and in (see Figure 1).
A polyomino chain is known as a polyomino ortho-chain and polyomino para-chain if and with respectively.
Two distinct connections to the para- or ortho-vertices are possible for the ending square to provide the local arrangements, written as (see Figure 2).
Figure 2.
The two types of local arrangements in polyomino chains.
A polyomino chain is known as polyomino chain with squares if the terminal squares are added gradually. At each stage , a random choice is made from the following constructions:
- 1.
- with probability ,
- 2.
- with probability
where probability is constant, independent of the step parameter . Particularly, the irregular polyomino chain is known as the polyomino ortho-chain . Additionally, is termed as the polyomino para-chain .
2. The Expected Value of the Multiplicative Degree-Kirchhoff Index of a Random Polyomino Chain
The multiplicative degree-Kirchhoff index for a random polyomino chain is a random variable. Here, we propose a precise formula for its expected value .
Let the terminal square is spanned by vertices and a new edge is labeled as (as shown in Figure 1). For each , we have
Meanwhile,
Theorem 1.
The expected value (for ) is provided as the multiplicative degree-Kirchhoff index of an arbitrary polyomino chain
Proof.
For a random polyomino chain , a random variable is given as . We write to represent its expected value. Consider these two significant situations, for instance:
- Case 1:Here, correlates to the vertex labeled or . As a result, is equivalent to
- Case 2:Here, correlates to the vertex labeled As a result, is equivalent to
Since the probabilities for the above mentioned two cases in random polyomino chains are and , respectively, we can determine the expected value as:
Now, by applying the properties of mathematical expectation and check that , we obtain
The boundary condition is
Using the recurrence relation in Equation (15), we obtain
Through the use of the expectation operator and Equation (14), we obtain
The used condition is
and Equation (16) can be rewritten as
Using the recurrence relation in above equation, we obtain
Particularly,
- If .
- If .
□
Corollary 1.
Let be a random polyomino chain. Then,
Proof.
With reference to Theorem 1, we have
Note that , by a direct calculation, one has
- If , the polyomino ortho-chain realizes a minimum of .
- If , the polyomino para-chain realizes a maximum of .
□
3. The Expected Value of the Additive Degree-Kirchhoff Index of a Random Polyomino Chain
Theorem 2.
The expected value of the additive degree-Kirchhoff index of a random polyomino chain for is
Proof.
As described above, the polyomino chain is obtained by joining to a new terminal polyomino with a cutting edge, as shown in Figure 2. By using Equation (4), one has
where;
Put , as discussed in Theorem 1, one has
By Equations (5) and (6), one has
Note that,
Then, Equation (17) can be rewritten as
For a random polyomino chain is a random variable with expected value
The following two possible cases helped us to proceed our work further.
- Case 1:Here, coincides with the vertices or . Consequently, is given by
- Case 2:Here, coincides with the vertex . Consequently, is given by
Since the aforementioned in irregular polyomino chains with probability, two scenarios happen, and , respectively, we can obtain the following result:
By applying the properties of mathematical expectation to the equation mentioned above and noting that , we obtain
The boundary condition is
Using the recurrence relation in Equation (19), one has
By applying the properties of mathematical expectation to Equation (18), we obtain
Thus,
The boundary condition is given as
Using the recurrence relation in Equation (20) and the boundary condition, we obtain
In particular,
- If
- If
□
Corollary 2.
Let be a random polyomino chain. Then,
Proof.
According to Theorem 2, we have
Note that for , by a direct calculation, we have
- If , the polyomino ortho-chain realizes a minimum of .
- If , the polyomino para-chain realizes a maximum of .
□
4. Conclusions
In this article, we computed the exact formulae for a highly specific category of a polyomino graph, known as subgraphs or polyomino chains by using topological indices, namely the multiplicative degree-Kirchhoff index and the additive degree-Kirchhoff index. This study also characterizes the highest degree of the expected value for the mentioned graph. The given strategy allows the computation of the expected value for the Schultz index and Gutman index, which is extremely viable for a random polyomino chain. These results are restricted to random polyomino chains. In the future, we hope to create some new structures/graphs and then study their topological indices to better understand their underlying topologies.
Author Contributions
Writing—original draft preparation, M.L.; writing—review and editing, P.A.; software, M.A. and H.A.; validation, H.A.; formal analyis, F.M.; methodology, M.A. All authors have read and agreed to the published version of the manuscript.
Funding
This work supported by the Natural Science Foundation of Fujian Province under the grant number 2022J011149; the Youth and Middle-aged Project of Fujian Province Education Department the grant number JAT200599.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
No data were used in this study.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Klein, D.J.; Randić, M. Resistance distance. J. Math. Chem. 1993, 12, 81–95. [Google Scholar] [CrossRef]
- Chen, H.; Zhang, F. Resistance distance and the normalized Laplacian spectrum. Discret. Appl. Math. 2007, 155, 654–661. [Google Scholar] [CrossRef]
- Gutman, I.; Feng, L.; Yu, G. Degree resistance distance of unicyclic graphs. Trans. Comb. 2012, 1, 27–40. [Google Scholar]
- Yang, Y. The Kirchhoff index of subdivisions of graphs. Discret. Appl. Math. 2014, 171, 153–157. [Google Scholar] [CrossRef]
- Yang, Y.; Klein, D.J. Resistance distance-based graph invariants of subdivisions and triangulations of graphs. Discret. Appl. Math. 2015, 181, 260–274. [Google Scholar] [CrossRef]
- Liu, X.; Zhou, J.; Bu, C. Resistance distance and Kirchhoff index of R-vertex join and R-edge join of two graphs. Discret. Appl. Math. 2015, 187, 130–139. [Google Scholar] [CrossRef]
- Du, J.; Su, G.; Tu, J.; Gutman, I. The degree resistance distance of cacti. Discret. Appl. Math. 2015, 188, 16–24. [Google Scholar] [CrossRef]
- Qun, L. Some results of resistance distance and Kirchhoff index of subdivision vertex-edge corona for graphs. IAENG Int. J. Appl. Math. 2016, 46, 346–352. [Google Scholar]
- Bapat, R.B.; Karimi, M.; Liu, J.B. Kirchhoff index and degree Kirchhoff index of complete multipartite graphs. Discret. Appl. Math. 2017, 232, 41–49. [Google Scholar] [CrossRef]
- Qi, X.; Zhou, B. On the degree Kirchhoff index of unicyclic graphs. Discret. Appl. Math. 2020, 284, 86–98. [Google Scholar] [CrossRef]
- Zhang, L.; Li, Q.; Li, S.; Zhang, M. The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain. Discret. Appl. Math. 2020, 282, 243–256. [Google Scholar] [CrossRef]
- Wei, S.; Shiu, W.C. Enumeration of Wiener indices in random polygonal chains. J. Math. Anal. Appl. 2019, 469, 537–548. [Google Scholar] [CrossRef]
- Zhang, J.; Peng, X.; Chen, H. The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain. Discret. Appl. Math. 2021, 299, 62–73. [Google Scholar] [CrossRef]
- Hechao, L.I.U.; Rangwei, W.U.; Lihua, Y.O.U. Three types of Kirchhoff indices in the random cyclooctane chains. J. S. China Norm. Univ. (Nat. Sci. Ed.) 2021, 53, 96–103. [Google Scholar]
- Zhu, W.; Geng, X. Enumeration of the multiplicative degree-Kirchhoff index in the random polygonal chains. Molecules 2022, 27, 5669. [Google Scholar] [CrossRef]
- Berge, C.; Chen, C.C.; Chvátal, V.; Seow, C.S. Combinatorial properties of polyominoes. Combinatorica 1981, 1, 217–224. [Google Scholar] [CrossRef]
- Cockayne, E.J. Chessboard domination problems. Discret. Math. 1990, 86, 13–20. [Google Scholar] [CrossRef]
- Harary, F.; Mezey, P.G. Cell-shedding transformations, equivalence relations, and similarity measures for square-cell configurations. Int. J. Quantum Chem. 1997, 62, 353–361. [Google Scholar] [CrossRef]
- Wu, T.; Lü, H.; Zhang, X. Extremal Matching Energy of Random Polyomino Chains. Entropy 2017, 19, 684. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).