Next Article in Journal
Passive Grouping Enhances Proto-Arithmetic Calculation for Leftward Correct Responses
Next Article in Special Issue
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
Previous Article in Journal
Near-Miss Symmetric Polyhedral Cages
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Kirchhoff Index and Additive Kirchhoff Index Based on Multiplicative Degree for a Random Polyomino Chain

1
School of Mathematics and Information Engineering, Longyan University, Longyan 364012, China
2
School of Mathematical Sciences, Xiamen University, Xiamen 361005, China
3
Faculty of Sciences, The Superior University, Lahore 54000, Pakistan
4
Department of Mathematics, Riphah International University, Faisalabad 38000, Pakistan
5
Department of Mathematics, Government College Women University, Faisalabad 38000, Pakistan
6
Department of Mechanical Engineering, College of Engineering, Qassim University, Unaizah 56215, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(3), 718; https://doi.org/10.3390/sym15030718
Submission received: 10 February 2023 / Revised: 4 March 2023 / Accepted: 8 March 2023 / Published: 14 March 2023
(This article belongs to the Special Issue Symmetric Matrices of Graphs: Topics and Advances)

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ć [1] proposed the notion of the Kirchhoff index and resistance distance of graphs in 1993. Suppose G as a symmetric graph with the vertex set { υ ˘ 1 , υ ˘ 2 , υ ˘ 3 , , υ ˘ η } , and the corresponding electrical network N is obtained when each edge of the graph is replaced by a fixed resistance (unit resistance). For a graph G , the resistance distance between any two vertices is denoted by γ ˘ ( υ ˘ i , υ ˘ j ) , where υ ˘ i , υ ˘ j G . 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 G , represented as K f ( G ) , and written as
K f ( G ) = i < j γ ˘ ( υ ˘ i , υ ˘ j ) = 1 2 i = 1 η j = 1 η γ ˘ ( υ ˘ i , υ ˘ j ) = 1 2 i = 1 η γ ˘ ( υ ˘ i | ( G ) ,
where
γ ˘ ( υ ˘ i | ( G ) = j = 1 η γ ˘ ( υ ˘ i , υ ˘ j ) .
Chen and Zhang [2] introduced a modern graph invariant in 2007, which is stated as
K f * ( G ) = 1 i < j η δ ˘ i δ ˘ j γ ˘ ( υ ˘ i , υ ˘ j ) = 1 2 i = 1 η j = 1 η δ ˘ i δ ˘ j γ ˘ ( υ ˘ i , υ ˘ j ) ,
where δ ˘ i indicates the vertex’s degree υ ˘ i of the graph G .
Gutman et al. [3] introduced the idea of the additive degree-Kirchhoff index in 2012, defined as
K f + ( G ) = 1 i < j η ( δ ˘ i + δ ˘ j ) γ ˘ ( υ ˘ i , υ ˘ j ) .
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 [4,5,6,7,8,9,10]. 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 [11]. For extended studies on random polygonal chains, mostly readers referred to the recent papers [12,13,14,15]. 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 [2], 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 [16] (also known as chessboards [17] or arrangements that use square cells [18]) 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 [19]. A polyomino chain Q η having “ η ” squares, that is to be considered as a polyomino chain Q η 1 having “ η 1 ” squares adjacent to a indicated in picture, a new terminal square by a cut edge as shown in Figure 1.
If Q η = ϝ ˘ 1 , ϝ ˘ 2 , , ϝ ˘ η is a polyomino chain having η ( 2 ) squares, ϝ ˘ κ as the κ th square of Q η connected to ϝ ˘ κ 1 with a cut edge μ ˘ κ 1 ω ˘ κ , where μ ˘ κ 1 ϝ ˘ κ 1 and ω ˘ κ ϝ ˘ κ , ( 2 κ η ) . A vertex υ ˘ is known as ortho-vertex ( o ˘ κ ) and para-vertex ( p ˘ κ ) of ϝ ˘ κ if the distance between υ ˘ and ω ˘ κ is one and two, respectively. It is easy to establish that ω ˘ η = λ ˘ 1 , o ˘ η = λ ˘ 2 , λ ˘ 4 , and p ˘ η = λ ˘ 3 in ϝ ˘ η (see Figure 1).
A polyomino chain Q η is known as a polyomino ortho-chain Q η o and polyomino para-chain Q η p if μ ˘ κ = o ˘ κ and μ ˘ κ = p ˘ κ with 2 κ η 1 , respectively.
Two distinct connections to the para- or ortho-vertices are possible for the ending square η 2 to provide the local arrangements, written as Q η + 1 1 Q η + 1 2 (see Figure 2).
A polyomino chain is known as polyomino chain Q ( η , t ) with η squares if the terminal squares are added gradually. At each stage κ = ( 3 , 4 , , η ) , a random choice is made from the following constructions:
1.
Q κ 1 Q κ 1 with probability t ,
2.
Q κ 1 Q κ 2 with probability 1 t ,
where probability t is constant, independent of the step parameter κ . Particularly, the irregular polyomino chain Q ( η , 1 ) is known as the polyomino ortho-chain Q η o . Additionally, Q ( η , 0 ) is termed as the polyomino para-chain Q η p .

2. The Expected Value of the Multiplicative Degree-Kirchhoff Index of a Random Polyomino Chain

The multiplicative degree-Kirchhoff index K f * ( Q η ) for a random polyomino chain Q η is a random variable. Here, we propose a precise formula for its expected value E ( K f * ( Q η ) ) .
Let the terminal square is spanned by vertices { λ ˘ 1 , λ ˘ 2 , λ ˘ 3 , λ ˘ 4 } and a new edge is labeled as μ ˘ η λ ˘ 1 (as shown in Figure 1). For each υ ˘ V Q η , we have
γ ˘ ( λ ˘ 1 , υ ˘ ) = γ ˘ ( μ ˘ η , υ ˘ ) + 1 , γ ˘ ( λ ˘ 2 , υ ˘ ) = γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 ,
γ ˘ ( λ ˘ 3 , υ ˘ ) = γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 1 , γ ˘ ( λ ˘ 4 , υ ˘ ) = γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 ,
υ ˘ V Q η δ ˘ Q η + 1 ( υ ˘ ) = 10 η 1 .
Meanwhile,
i = 1 4 δ ˘ ( λ ˘ i ) γ ˘ ( λ ˘ 1 , λ ˘ i ) = 2 × 3 4 + 2 × 1 + 2 × 3 4 = 5 ,
i = 1 4 δ ˘ ( λ ˘ i ) γ ˘ ( λ ˘ 2 , λ ˘ i ) = 3 × 3 4 + 2 × 3 4 + 2 × 1 = 23 4 ,
i = 1 4 δ ˘ ( λ ˘ i ) γ ˘ ( λ ˘ 3 , λ ˘ i ) = 3 × 1 + 2 × 3 4 + 2 × 3 4 = 6 ,
i = 1 4 δ ˘ ( λ ˘ i ) γ ˘ ( λ ˘ 4 , λ ˘ i ) = 3 × 3 4 + 2 × 1 + 2 × 3 4 = 23 4 .
Theorem 1. 
The expected value (for η 1 ) is provided as the multiplicative degree-Kirchhoff index of an arbitrary polyomino chain
E ( K f * ( Q η ) ) = ( 100 3 25 6 t ) η 3 + ( 25 2 t 10 ) η 2 + ( 25 3 t 7 3 ) η 1 .
Proof. 
By Equation (3), it is clear that
K f * ( Q η + 1 ) = { μ ˘ , υ ˘ } V Q η δ ˘ ( μ ˘ ) δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ , υ ˘ ) + υ ˘ V Q η λ ˘ i V ϝ ˘ η + 1 δ ˘ ( υ ˘ ) δ ˘ ( λ ˘ i ) γ ˘ ( υ ˘ , λ ˘ i ) + { λ ˘ i , λ ˘ j } V ϝ ˘ η + 1 δ ˘ ( λ ˘ i ) δ ˘ ( λ ˘ j ) γ ˘ ( λ ˘ i , λ ˘ j ) .
Note that
{ μ ˘ , υ ˘ } V Q η δ ˘ ( μ ˘ ) δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ , υ ˘ ) = { μ ˘ , υ ˘ } V Q η { μ ˘ η } δ ˘ ( μ ˘ ) δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ , υ ˘ ) + υ ˘ V Q η { μ ˘ η } δ ˘ ( υ ˘ ) δ ˘ Q η + 1 ( μ ˘ η ) γ ˘ ( μ ˘ η , υ ˘ ) , = { μ ˘ , υ ˘ } V Q η { μ ˘ η } δ ˘ ( μ ˘ ) δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ , υ ˘ ) + υ ˘ V Q η { μ ˘ η } δ ˘ ( υ ˘ ) ( δ ˘ Q η ( μ ˘ η ) + 1 ) γ ˘ ( μ ˘ η , υ ˘ ) , = K f * ( Q η ) + υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) .
By Equations (5) and (6), we obtain
υ ˘ V Q η λ ˘ i V ϝ ˘ η + 1 δ ˘ ( υ ˘ ) δ ˘ ( λ ˘ i ) γ ˘ ( υ ˘ , λ ˘ i ) = υ ˘ V Q η δ ˘ ( υ ˘ ) [ 3 ( γ ˘ ( μ ˘ η , υ ˘ ) + 1 ) + 2 ( γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 ) + 2 ( γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 1 ) + 2 ( γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 ) ] = υ ˘ V Q η δ ˘ ( υ ˘ ) [ 9 γ ˘ ( μ ˘ η , υ ˘ ) + 14 ] , = 9 υ ˘ V Q η δ ˘ ( υ ˘ ) ( γ ˘ ( μ ˘ η , υ ˘ ) ) + 14 υ ˘ V Q η δ ˘ ( υ ˘ ) , = 9 υ ˘ V Q η δ ˘ ( υ ˘ ) ( γ ˘ ( μ ˘ η , υ ˘ ) ) + 14 ( 10 η 1 ) .
( λ ˘ i , λ ˘ j ) V ϝ ˘ η + 1 δ ˘ ( λ ˘ i ) δ ˘ ( λ ˘ j ) γ ˘ ( λ ˘ i , λ ˘ j ) = 1 2 i = 1 4 j = 1 4 δ ˘ ( λ ˘ i ) δ ˘ ( λ ˘ j ) γ ˘ ( λ ˘ i , λ ˘ j ) , = 1 2 i = 1 4 δ ˘ ( λ ˘ i ) j = 1 4 δ ˘ ( λ ˘ j ) γ ˘ ( λ ˘ i , λ ˘ j ) , = 1 2 ( 3.5 + 2 . 23 4 + 2.6 + 2 . 23 4 ) , = 25 .
Then,
K f * ( Q η + 1 ) = K f * ( Q η ) + 10 υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) + 14 ( 10 η 1 ) + 25 .
For a random polyomino chain Q η , a random variable is given as v V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) . We write R η = E ( υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) ) to represent its expected value. Consider these two significant situations, for instance:
  • Case 1:  Q η Q η + 1 1
    Here, μ ˘ η correlates to the vertex labeled λ ˘ 2 or λ ˘ 4 . As a result, υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) is equivalent to υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( λ ˘ 2 , υ ˘ ) .
  • Case 2:  Q η Q η + 1 2
    Here, μ ˘ η correlates to the vertex labeled λ ˘ 3 . As a result, υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) is equivalent to υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( λ ˘ 3 , υ ˘ ) .
Since the probabilities for the above mentioned two cases in random polyomino chains are t and 1 t , respectively, we can determine the expected value R η as:
R η = E ( υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) ) . = t ( υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( λ ˘ 2 , υ ˘ ) ) + ( 1 t ) ( υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( λ ˘ 3 , υ ˘ ) ) , = t υ ˘ V Q η 1 δ ˘ ( υ ˘ ) [ γ ˘ ( μ ˘ η 1 , υ ˘ ) + 1 + 3 4 ] + υ ˘ ϝ ˘ η δ ˘ ( υ ˘ ) [ γ ˘ ( λ ˘ 2 , υ ˘ ) ] + ( 1 t ) υ ˘ V Q η 1 δ ˘ ( υ ˘ ) [ γ ˘ ( μ ˘ η 1 , υ ˘ ) + 1 + 1 ] + υ ˘ ϝ ˘ η δ ˘ ( υ ˘ ) [ γ ˘ ( λ ˘ 3 , υ ˘ ) ] , = t υ ˘ V Q η 1 δ ˘ ( υ ˘ ) [ γ ˘ ( μ ˘ η 1 , υ ˘ ) ] + 7 4 υ ˘ V Q η 1 δ ˘ ( υ ˘ ) + 23 4 + ( 1 t ) υ ˘ V Q η 1 δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η 1 , υ ˘ ) + 2 υ ˘ V Q η 1 δ ˘ ( υ ˘ ) + 6 , = t υ ˘ V Q η 1 δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η 1 , υ ˘ ) + 7 4 ( 10 η 11 ) + 23 4 + ( 1 t ) υ ˘ V Q η 1 δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η 1 , υ ˘ ) + 2 ( 10 η 11 ) + 6 , = υ ˘ V Q η 1 δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η 1 , υ ˘ ) + ( 20 5 2 t ) η + 5 2 t 16 .
Now, by applying the properties of mathematical expectation and check that E ( R η ) = R η , we obtain
R η = R η 1 + ( 20 5 2 t ) η + 5 2 t 16 .
The boundary condition is
R 1 = E ( υ ˘ V Q 1 δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ 1 , υ ˘ ) ) = 5 .
Using the recurrence relation in Equation (15), we obtain
R η = R 1 + ( 20 5 2 t ) [ η + ( η 1 ) + + 2 ] + ( η 1 ) ( 5 2 t 16 ) , = ( 10 5 4 t ) η 2 + ( 5 4 t 6 ) η + 1 .
Through the use of the expectation operator and Equation (14), we obtain
E ( K f * ( Q η + 1 ) ) = E ( K f * ( Q η ) ) + 10 R η + 14 ( 10 η 1 ) + 25 , = E ( K f * ( Q η ) ) + 10 [ ( 10 5 4 t ) η 2 + ( 5 4 t 6 ) η + 1 ] + 140 η + 11 , = E ( K f * ( Q η ) ) + ( 100 25 2 t ) η 2 + ( 25 2 t + 80 ) η + 21 .
The used condition is
E ( K f * ( Q 1 ) ) = 1 2 i = 1 4 j = 1 4 δ ˘ ( λ ˘ i ) δ ˘ ( λ ˘ j ) γ ˘ ( λ ˘ i , λ ˘ j ) . = 1 2 i = 1 4 δ ˘ ( λ ˘ i ) j = 1 4 δ ˘ ( λ ˘ j ) γ ˘ ( λ ˘ i , λ ˘ j ) , = 1 2 [ 2 ( 5 + 5 + 5 + 5 ) ] , = 20 .
and Equation (16) can be rewritten as
E ( K f * ( Q η ) ) = E ( K f * ( Q η 1 ) ) + ( 100 25 2 t ) ( η 1 ) 2 + ( 25 2 t + 80 ) ( η 1 ) + 21 .
Using the recurrence relation in above equation, we obtain
E ( K f * ( Q η ) ) = E ( K f * ( Q 1 ) ) + ( 100 25 2 t ) [ ( η 1 ) 2 + ( η 2 ) 2 + + 1 2 ] + ( 25 2 t + 80 ) [ ( η 1 ) + ( η 2 ) + + 1 ] + 21 ( η 1 ) , = E ( K f * ( Q 1 ) ) + ( 100 25 2 t ) η ( η 1 ) ( 2 η 1 ) 6 + ( 25 2 t + 80 ) η ( η 1 ) 2 + 21 ( η 1 ) , = ( 100 3 25 6 t ) η 3 + ( 25 2 t 10 ) η 2 + ( 25 3 t 7 3 ) η 1 .
Particularly,
  • If t = 1 , E ( K f * ( Q η o ) ) = 175 6 η 3 + 5 2 η 2 32 3 η 1 .
  • If t = 0 , E ( K f * ( Q η p ) ) = 100 3 η 3 10 η 2 7 3 η 1 .
Corollary 1. 
Let Q η ( η 3 ) be a random polyomino chain. Then,
E ( K f * ( Q η o ) ) E ( K f * ( Q η ) ) E ( K f * ( Q η p ) ) .
Proof. 
With reference to Theorem 1, we have
E ( K f * ( Q η ) ) = ( 25 6 η 3 + 25 2 η 2 25 3 η ) t + 100 3 η 3 10 η 2 7 3 η 1 .
Note that η 3 , by a direct calculation, one has
E ( K f * ( Q η ) ) t = 25 6 η 3 + 25 2 η 2 25 3 η = 25 6 η ( η 2 3 η + 2 ) < 0 .
  • If t = 1 , the polyomino ortho-chain Q η o realizes a minimum of E ( K f * ( Q η ) ) .
  • If t = 0 , the polyomino para-chain Q η p realizes a maximum of E ( K f * ( Q η ) ) .

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 η 1 is
E ( K f + ( Q η ) ) = ( 80 3 10 3 t ) η 3 + ( 10 t 36 ) η 2 ( 20 3 t + 23 3 ) η .
Proof. 
As described above, the polyomino chain Q η + 1 is obtained by joining Q η to a new terminal polyomino with a cutting edge, as shown in Figure 2. By using Equation (4), one has
K f + ( Q η + 1 ) = Δ 1 + Δ 2 + Δ 3 .
where;
Δ 1 = { μ ˘ , υ ˘ } V Q η ( δ ˘ ( μ ˘ ) + δ ˘ ( υ ˘ ) ) γ ˘ ( μ ˘ , υ ˘ ) , Δ 2 = υ ˘ V Q η λ ˘ i V ϝ ˘ η + 1 ( δ ˘ ( υ ˘ ) + δ ˘ ( λ ˘ i ) ) γ ˘ ( υ ˘ , λ ˘ i ) , Δ 3 = ( λ ˘ i , λ ˘ j ) V ϝ ˘ η + 1 ( δ ˘ ( λ ˘ i ) + δ ˘ ( λ ˘ j ) ) γ ˘ ( λ ˘ i , λ ˘ j ) .
Put γ ˘ ( μ ˘ η | Q η ) = υ ˘ V Q η γ ˘ ( μ ˘ η , υ ˘ ) , as discussed in Theorem 1, one has
Δ 1 = { μ ˘ , υ ˘ } V Q η ( δ ˘ ( μ ˘ ) + δ ˘ ( υ ˘ ) ) γ ˘ ( μ ˘ , υ ˘ ) , = { μ ˘ , υ ˘ } V Q η μ ˘ η ( δ ˘ ( μ ˘ ) + δ ˘ ( υ ˘ ) ) γ ˘ ( μ ˘ , υ ˘ ) + υ ˘ V Q η μ ˘ η ( δ ˘ ( υ ˘ ) + δ ˘ Q η + 1 ( μ ˘ η ) ) γ ˘ ( μ ˘ η , υ ˘ ) , = { μ ˘ , υ ˘ } V Q η μ ˘ η ( δ ˘ ( μ ˘ ) + δ ˘ ( υ ˘ ) ) γ ˘ ( μ ˘ , υ ˘ ) + υ ˘ V Q η μ ˘ η ( δ ˘ ( υ ˘ ) + δ ˘ Q η ( μ ˘ η ) + 1 ) γ ˘ ( μ ˘ η , υ ˘ ) , = K f + ( Q η ) + υ ˘ V Q η γ ˘ ( μ ˘ η , υ ˘ ) , = K f + ( Q η ) + γ ˘ ( μ ˘ η | Q η ) .
By Equations (5) and (6), one has
Δ 2 = υ ˘ V Q η λ ˘ i V ϝ ˘ η + 1 ( δ ˘ ( υ ˘ ) + δ ˘ ( λ ˘ i ) ) γ ˘ ( υ ˘ , λ ˘ i ) = υ ˘ V Q η λ ˘ i V ϝ ˘ η + 1 δ ˘ ( υ ˘ ) γ ˘ ( υ ˘ , λ ˘ i ) + υ ˘ V Q η λ ˘ i V ϝ ˘ η + 1 δ ˘ ( λ ˘ i ) γ ˘ ( υ ˘ , λ ˘ i ) , = υ ˘ V Q η δ ˘ ( υ ˘ ) [ γ ˘ ( μ ˘ η , υ ˘ ) + 1 + γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 + γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 1 + γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 ] + υ ˘ V Q η { 3 [ γ ˘ ( μ ˘ η , υ ˘ ) + 1 ] + 2 [ γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 ] + 2 [ γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 1 ] + 2 [ γ ˘ ( μ ˘ η , υ ˘ ) + 1 + 3 4 ] } , = 4 υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) + 13 2 υ ˘ V Q η δ ˘ ( υ ˘ ) + 9 γ ˘ ( μ ˘ η | Q η ) + 56 η , = 4 υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) + 13 2 ( 10 η 1 ) + 9 r ( μ ˘ η | Q η ) + 56 η .
Note that,
i = 1 4 ( λ ˘ κ , λ ˘ i ) = 5 2 ( w h e r e κ = 1 , 2 , 3 , 4 ) .
Δ 3 = ( λ ˘ i , λ ˘ j ) V ϝ ˘ η + 1 ( δ ˘ ( λ ˘ i ) + δ ˘ ( λ ˘ j ) ) γ ˘ ( λ ˘ i , λ ˘ j ) = 1 2 i = 1 4 j = 1 4 ( δ ˘ ( λ ˘ i ) + δ ˘ ( λ ˘ j ) ) γ ˘ ( λ ˘ i , λ ˘ j ) , = i = 1 4 j = 1 4 δ ˘ ( λ ˘ i ) γ ˘ ( λ ˘ i , λ ˘ j ) , = i = 1 4 δ ˘ ( λ ˘ i ) j = 1 4 γ ˘ ( λ ˘ i , λ ˘ j ) , = 5 2 i = 1 4 δ ˘ ( λ ˘ i ) , = 45 2 .
Then, Equation (17) can be rewritten as
K f + ( Q η + 1 ) = K f + ( Q η ) + 4 υ ˘ V Q η δ ˘ ( υ ˘ ) γ ˘ ( μ ˘ η , υ ˘ ) + 10 γ ˘ ( μ ˘ η | Q η ) + 121 η + 16 .
For a random polyomino chain Q η , γ ˘ ( μ ˘ η | Q η ) is a random variable with expected value
D η = E ( γ ˘ ( μ ˘ η | Q η ) ) .
The following two possible cases helped us to proceed our work further.
  • Case 1:  Q η Q η + 1 1
    Here, μ ˘ η coincides with the vertices λ ˘ 2 or λ ˘ 4 . Consequently, γ ˘ ( μ ˘ η | Q η ) is given by γ ˘ ( λ ˘ 2 | Q η ) .
  • Case 2:  Q η Q η + 1 2
    Here, μ ˘ η coincides with the vertex λ ˘ 3 . Consequently, γ ˘ ( μ ˘ η | Q η ) is given by γ ˘ ( λ ˘ 3 | Q η ) .
Since the aforementioned in irregular polyomino chains with probability, two scenarios happen, t and 1 t , respectively, we can obtain the following result:
D η = E ( γ ˘ ( μ ˘ η | Q η ) ) , = t γ ˘ ( λ ˘ 2 | Q η ) + ( 1 t ) γ ˘ ( λ ˘ 3 | Q η ) , = t [ γ ˘ ( μ ˘ η 1 | Q η 1 ) + 4 ( η 1 ) ( 1 + 3 4 ) + 5 2 ] + ( 1 t ) [ γ ˘ ( μ ˘ η 1 | Q η 1 ) + 4 ( η 1 ) ( 1 + 1 ) + 5 2 ] , = γ ˘ ( μ ˘ η 1 | Q η 1 ) + ( 8 t ) η + t 11 2 .
By applying the properties of mathematical expectation to the equation mentioned above and noting that E ( D η ) = D η , we obtain
D η = D η 1 + ( 8 t ) η + t 11 2 .
The boundary condition is
D 1 = E ( γ ˘ ( μ ˘ 1 | Q 1 ) ) = 5 2 .
Using the recurrence relation in Equation (19), one has
D η = D 1 + ( 8 t ) [ η + ( η 1 ) + + 2 ] + ( η 1 ) ( t 11 2 ) , = ( 8 t ) η 2 2 + ( t 2 3 2 ) η .
By applying the properties of mathematical expectation to Equation (18), we obtain
E ( K f + ( Q η + 1 ) ) = E ( K f + ( Q η ) ) + 10 D η + 4 R η + 121 η + 16 , = E ( K f + ( Q η ) ) + 10 [ ( 8 t ) η 2 2 + ( t 2 3 2 ) η ] + 4 [ ( 10 5 4 t ) η 2 + ( 5 4 t 6 ) η + 1 ] + 121 η + 16 , = E ( K f + ( Q η ) ) + ( 80 10 t ) η 2 + ( 10 t + 82 ) η + 20 .
Thus,
E ( K f + ( Q η ) ) = E ( K f + ( Q η 1 ) ) + ( 80 10 t ) ( η 1 ) 2 + ( 10 t + 82 ) ( η 1 ) + 20 .
The boundary condition is given as
E ( K f + ( Q 1 ) ) = 20 .
Using the recurrence relation in Equation (20) and the boundary condition, we obtain
E ( K f + ( Q η ) ) = E ( K f + ( Q 1 ) ) + ( 80 10 t ) [ ( η 1 ) 2 + ( η 2 ) 2 + + 1 2 ] + ( 10 t + 82 ) [ ( η 1 ) + ( η 2 ) + . . . + 1 ] + 20 ( η 1 ) , = 20 + ( 80 10 t ) η ( η 1 ) ( 2 η 1 ) 6 + ( 10 t + 82 ) η ( η 1 ) 2 + 20 ( η 1 ) , = ( 80 3 10 3 t ) η 3 + ( 10 t + 1 ) η 2 ( 20 3 t + 23 3 ) η .
In particular,
  • If t = 1 , E ( K f + ( Q η o ) ) = 70 3 η 3 + 11 η 2 43 3 η .
  • If t = 0 , E ( K f + ( Q η p ) ) = 80 3 η 3 + η 2 23 3 η .
Corollary 2. 
Let Q η ( η 3 ) be a random polyomino chain. Then,
E ( K f + ( Q η o ) ) E ( K f + ( Q η ) ) E ( K f + ( Q η p ) ) .
Proof. 
According to Theorem 2, we have
E ( K f + ( Q η ) ) = ( 10 3 η 3 + 10 η 2 20 3 η ) t + 80 3 η 3 + η 2 23 3 η .
Note that for η 3 , by a direct calculation, we have
E ( K f + ( Q η ) ) t = 10 3 η 3 + 10 η 2 20 3 η = 10 3 η ( η 2 3 η + 2 ) < 0 .
  • If t = 1 , the polyomino ortho-chain Q η o realizes a minimum of E ( K f + ( Q η ) ) .
  • If t = 0 , the polyomino para-chain Q η p realizes a maximum of E ( K f + ( Q η ) ) .

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

  1. Klein, D.J.; Randić, M. Resistance distance. J. Math. Chem. 1993, 12, 81–95. [Google Scholar] [CrossRef]
  2. Chen, H.; Zhang, F. Resistance distance and the normalized Laplacian spectrum. Discret. Appl. Math. 2007, 155, 654–661. [Google Scholar] [CrossRef] [Green Version]
  3. Gutman, I.; Feng, L.; Yu, G. Degree resistance distance of unicyclic graphs. Trans. Comb. 2012, 1, 27–40. [Google Scholar]
  4. Yang, Y. The Kirchhoff index of subdivisions of graphs. Discret. Appl. Math. 2014, 171, 153–157. [Google Scholar] [CrossRef]
  5. 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]
  6. 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]
  7. Du, J.; Su, G.; Tu, J.; Gutman, I. The degree resistance distance of cacti. Discret. Appl. Math. 2015, 188, 16–24. [Google Scholar] [CrossRef]
  8. 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]
  9. 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]
  10. Qi, X.; Zhou, B. On the degree Kirchhoff index of unicyclic graphs. Discret. Appl. Math. 2020, 284, 86–98. [Google Scholar] [CrossRef]
  11. 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]
  12. Wei, S.; Shiu, W.C. Enumeration of Wiener indices in random polygonal chains. J. Math. Anal. Appl. 2019, 469, 537–548. [Google Scholar] [CrossRef]
  13. 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]
  14. 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]
  15. Zhu, W.; Geng, X. Enumeration of the multiplicative degree-Kirchhoff index in the random polygonal chains. Molecules 2022, 27, 5669. [Google Scholar] [CrossRef]
  16. Berge, C.; Chen, C.C.; Chvátal, V.; Seow, C.S. Combinatorial properties of polyominoes. Combinatorica 1981, 1, 217–224. [Google Scholar] [CrossRef]
  17. Cockayne, E.J. Chessboard domination problems. Discret. Math. 1990, 86, 13–20. [Google Scholar] [CrossRef] [Green Version]
  18. 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]
  19. Wu, T.; Lü, H.; Zhang, X. Extremal Matching Energy of Random Polyomino Chains. Entropy 2017, 19, 684. [Google Scholar] [CrossRef] [Green Version]
Figure 1. A polyomino chain Q η with η squares.
Figure 1. A polyomino chain Q η with η squares.
Symmetry 15 00718 g001
Figure 2. The two types of local arrangements in polyomino chains.
Figure 2. The two types of local arrangements in polyomino chains.
Symmetry 15 00718 g002
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.

Share and Cite

MDPI and ACS Style

Li, M.; Asif, M.; Ali, H.; Mahmood, F.; Ali, P. Kirchhoff Index and Additive Kirchhoff Index Based on Multiplicative Degree for a Random Polyomino Chain. Symmetry 2023, 15, 718. https://doi.org/10.3390/sym15030718

AMA Style

Li M, Asif M, Ali H, Mahmood F, Ali P. Kirchhoff Index and Additive Kirchhoff Index Based on Multiplicative Degree for a Random Polyomino Chain. Symmetry. 2023; 15(3):718. https://doi.org/10.3390/sym15030718

Chicago/Turabian Style

Li, Meilian, Muhammad Asif, Haidar Ali, Fizza Mahmood, and Parvez Ali. 2023. "Kirchhoff Index and Additive Kirchhoff Index Based on Multiplicative Degree for a Random Polyomino Chain" Symmetry 15, no. 3: 718. https://doi.org/10.3390/sym15030718

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop