
For an integer h≥0, the hth order Randić index for a simple graph G is defined as Rh(G)=∑π1√v1(π)v2(π)⋯vh+1(π), where π extends over all paths of length h in G and vi(π) denotes the degree of the i-th vertex of the path π. In this paper, we showed that the hth order Randić index Rh(T) of a double starlike tree T (a tree with two vertices of degrees m1,m2>2) is completely determined by its branches of length ≤h. As a consequence, we proved that the double starlike trees with equal h-Randić index are isomorphic, except for some special values for m1 and m2.
Citation: Zhenhua Su, Zikai Tang, Hanyuan Deng. Higher-order Randić index and isomorphism of double starlike trees[J]. AIMS Mathematics, 2023, 8(12): 31186-31197. doi: 10.3934/math.20231596
[1] | Muhammad Ajmal, Xiwang Cao, Muhammad Salman, Jia-Bao Liu, Masood Ur Rehman . A special class of triple starlike trees characterized by Laplacian spectrum. AIMS Mathematics, 2021, 6(5): 4394-4403. doi: 10.3934/math.2021260 |
[2] | Chang Liu, Jianping Li . Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number. AIMS Mathematics, 2022, 7(2): 2529-2542. doi: 10.3934/math.2022142 |
[3] | Tariq A. Alraqad, Igor Ž. Milovanović, Hicham Saber, Akbar Ali, Jaya P. Mazorodze, Adel A. Attiya . Minimum atom-bond sum-connectivity index of trees with a fixed order and/or number of pendent vertices. AIMS Mathematics, 2024, 9(2): 3707-3721. doi: 10.3934/math.2024182 |
[4] | Zhen Lin, Ting Zhou, Xiaojing Wang, Lianying Miao . The general Albertson irregularity index of graphs. AIMS Mathematics, 2022, 7(1): 25-38. doi: 10.3934/math.2022002 |
[5] | Swathi Shetty, B. R. Rakshith, N. V. Sayinath Udupa . Extremal graphs and bounds for general Gutman index. AIMS Mathematics, 2024, 9(11): 30454-30471. doi: 10.3934/math.20241470 |
[6] | Guifu Su, Yue Wu, Xiaowen Qin, Junfeng Du, Weili Guo, Zhenghang Zhang, Lifei Song . Sharp bounds for the general Randić index of graphs with fixed number of vertices and cyclomatic number. AIMS Mathematics, 2023, 8(12): 29352-29367. doi: 10.3934/math.20231502 |
[7] | Zenan Du, Lihua You, Hechao Liu, Yufei Huang . The Sombor index and coindex of two-trees. AIMS Mathematics, 2023, 8(8): 18982-18994. doi: 10.3934/math.2023967 |
[8] | Akbar Ali, Sadia Noureen, Akhlaq A. Bhatti, Abeer M. Albalahi . On optimal molecular trees with respect to Sombor indices. AIMS Mathematics, 2023, 8(3): 5369-5390. doi: 10.3934/math.2023270 |
[9] | Shabana Anwar, Muhammad Kamran Jamil, Amal S. Alali, Mehwish Zegham, Aisha Javed . Extremal values of the first reformulated Zagreb index for molecular trees with application to octane isomers. AIMS Mathematics, 2024, 9(1): 289-301. doi: 10.3934/math.2024017 |
[10] | Zhibin Du, Ayu Ameliatul Shahilah Ahmad Jamri, Roslan Hasni, Doost Ali Mojdeh . Maximal first Zagreb index of trees with given Roman domination number. AIMS Mathematics, 2022, 7(7): 11801-11812. doi: 10.3934/math.2022658 |
For an integer h≥0, the hth order Randić index for a simple graph G is defined as Rh(G)=∑π1√v1(π)v2(π)⋯vh+1(π), where π extends over all paths of length h in G and vi(π) denotes the degree of the i-th vertex of the path π. In this paper, we showed that the hth order Randić index Rh(T) of a double starlike tree T (a tree with two vertices of degrees m1,m2>2) is completely determined by its branches of length ≤h. As a consequence, we proved that the double starlike trees with equal h-Randić index are isomorphic, except for some special values for m1 and m2.
In mathematical chemistry, a topological index is a numeric quantity derived mathematically in a direct and unambiguous manner from the structural graph of a molecule, which is used to characterize some properties of a molecular graph. It is also a graph invariant since isomorphic graphs have the same value for a given topological index.
Many topological indices have been developed through the years and related successfully to physicochemical properties of organic molecules [1,2]. In order to define the concept of branching in molecular species [3,4], Randić [5] introduced in 1975 a topological index–the connectivity index (now called the Randić index), defined for a simple graph G as
R1(G)=∑π1√v1(π)v2(π), |
where π extends over all paths of length 1 and vi(π) denotes the degree of the i-th vertex of the path π. Note that for a path with (n+1) vertices and n edges, both of the vertex and edge can appear exactly once. It has become one of the most widely used and most successful in applications to physical and chemical properties [6]. For a review of historical details and a further bibliography on the chemical applications of the Randić index see [7,8,9,10].
For an integer h≥0, the connectivity index of order h (also called h-Randić index) [11] is defined as
Rh(G)=∑π1√v1(π)v2(π)⋯vh+1(π), |
where π extends over all paths of length h in G and vi(π) denotes the degree of the i-th vertex of the path π.
Higher-order Randić indices are of great interest in the theory of molecular graph theory and some of its mathematical properties have been reported in [12]. Examples of non-isomorphic trees T and T′ such that Rh(T)=Rh(T′) for all h≥0 exist [13]. However, it will not occur in starlike trees, i.e. trees that have a unique vertex of a degree greater than 2. In fact, Rada and Araujo [14] proved that starlike trees which have equal h-connectivity index for h≥0 are isomorphic.
Very recently, by a relation on trees with respect to edge division vectors, Song and Huang [15] found some sufficient conditions to determine whether some trees with the same topological index value are isomorphic or not. Further, several classes of trees, including balanced starlike trees and double star Sp,q, are uniquely determined by edge division vectors.
This leads naturally to determine h-Randić index of a double starlike tree, i.e., a tree that has only two vertices of a degree greater than 2. In this paper, we will show that for every integer h≥0, the higher-order Randić Rh(T) of a double starlike tree T is completely determined by its branches of length ≤h. As a consequence, we show that almost all the double starlike trees that have equal h-Randić index for all h≥0 are isomorphic.
Let G be a graph. The maximum vertex degree and the number of i-vertices (an i-vertex is a vertex of degree i) will be denoted by Δ(G) and ki(G), respectively. For an integer m≥2, a starlike tree T is a tree for which k1(T)=Δ(T)=m. The set of all starlike trees on n vertices with the maximal degree m is denoted by Ωn,m.
For two integers m1,m2≥2, a double starlike tree T is a tree with an edge u0v0 such that the components of T−{u0v0} are two starlike trees Tu0 and Tv0 with their maximal degrees m1−1 and m2−1, respectively, where dT(u0)=m1 and dT(v0)=m2. If n1=|V(Tu0)| and n2=|V(Tv0)|, then n1+n2=n=|V(T)|. A double starlike tree is displayed as in Figure 1. The set of all double starlike trees on n vertices with two adjacent branching vertices of degrees m1 and m2 are denoted by Ωn,m1,m2. Specifically, if one of the values m1 and m2 is 2, then the double starlike tree is a starlike tree.
For any two vertices u,w in T, we use [u,w] to represent the shortest path connecting u and w, and keep in mind that the number of edges in [u,w] is called the distance. Let T∈Ωn,m1,m2. If {u1,u2,⋯,um1−1} is the set of 1-vertices in Tu0, an l-branch of Tu0 is a path [u0,ui] of Tu0 such that d(u0,ui)=l. There is a similar definition for Tv0. We denote by rl(T) and sl(T) the numbers of l-branches in Tu0 and Tv0, respectively (see Figure 1).
Based on the notations introduced above, we clearly have the following relations:
r1+r2+⋯+rt1=m1−1,s1+s2+⋯+st2=m2−1, r1+2r2+⋯+t1rt1=n1−1,s1+2s2+⋯+t2st2=n2−1,n1+n2=n, |
where t1 and t2 represent the length of the longest branch in Tu0 and Tv0, respectively.
In this section, we will determine the higher-order Randić index of double starlike trees.
Theorem 3.1. Let T∈Ωn,m1,m2, where m1≠m2. Then
R0(T)=(m1+m2)(1−1√2)+1√m1+1√m2+n√2−2. |
As a consequence, if T′∈Ωn,m′1,m′2, then R0(T)=R0(T′) if and only if m1=m′1 and m2=m′2.
Proof.It is not difficult to obtain that k1(T)=m1+m2−2, k2(T)=n−m1−m2 and km1(T)=km2(T)=1. Hence,
R0(T)=(m1+m2−2)⋅1+(n−m1−m2)⋅1√2+1√m1+1√m2 |
=(m1+m2)(1−1√2)+1√m1+1√m2+n√2−2. |
Let f(m1,m2)=(m1+m2)(1−1√2)+1√m1+1√m2. Clearly, m1+m2∈N+, and 1√m1+1√m2∉N+. If R0(T)=R0(T′), then we have
m1+m2=m′1+m′2. | (3.1) |
1√m1+1√m2=1√m′1+1√m′2. | (3.2) |
In the following, we show that m1=m′1 and m2=m′2. Assume that m1≠m′1 and m2≠m′2, thus m1≠m′1≠m2≠m′2. For convenience, let a=√m1, b=√m2, c=√m′1 and d=√m′2. Without loss of generality, assume b<d<c<a. From equations (3.1) and (3.2), it can be concluded that
acdb=a−cd−b,a−cd−b=d+ba+c. |
Therefore,
acdb=d+ba+c. |
On the other hand, according to b<d<c<a, we have ac>bd and a+c>b+d, i.e.,
acdb>d+ba+c, |
a contradiction. Therefore, the assumption is not valid and the proof is done.
In the following, the set of all rational numbers is denoted by Q and the set of all irrational numbers is R−Q.
Theorem 3.2. Let T∈Ωn,m1,m2, where m1≠m2. Then
R1(T)=(1√m1−1√2m1+12−1√2)r1+(1√m2−1√2m2+12−1√2)s1 |
+[m1+m2−2√2+m1−1√2m1+m2−1√2m2+1√m1m2−(m1+m2)+n2+1]. |
Consequently, for T′∈Ωn,m′1,m′2, where m′1=m1 and m′2=m2, if R1(T)=R1(T′), then
(i) r1=r′1 and s1=s′1 when m1=2 or m2=2;
(ii) r1=r′1 and s1=s′1, except for the case √m1,√m2∈R−Q and √2m1,√2m2∈Q, when m1,m2≥3.
Proof. Note that 12∑m1−1i=r1+1d(u0,ui)+12∑m2−1i=s1+1d(v0,vi)=12(n−r1−s1−2). Keeping the notation of R1(T), we have
R1(T)=r1∑i=11√m1+m1−1∑i=r1+1[1√2+12(d(u0,ui)−2)+1√2m1] |
+s1∑i=11√m2+m2−1∑i=s1+1[1√2+12(d(v0,vi)−2)+1√2m2]+1√m1m2 |
=(1√m1−1√2m1+12−1√2)r1+(1√m2−1√2m2+12−1√2)s1+λ(n,m1,m2), |
where λ(n,m1,m2)=[m1+m2−2√2+m1−1√2m1+m2−1√2m2+1√m1m2−(m1+m2)+n2+1].
For convenience, let a=(1√m1−1√2m1+12−1√2), and b=(1√m2−1√2m2+12−1√2).
(i) If one of m1 and m2 is 2, assume that m1=2. Then R1(T)=ar1+bs1+λ(n,m1,m2). We can immediately deduce s1=s′1 from the condition R1(T)=R1(T′). In this case, we have r1=r′1=1 and a=0.
(ii) If m1,m2≥3, from R1(T)=R1(T′), we obtain that ar1+bs1=ar′1+bs′1. If r1=r′1(or s1=s′1), then we can obtain that s1=s′1 (or r1=r′1), the theorem is true. In the following, we will deduce a contradiction under the assumption of r1≠r′1 and s1≠s′1. Denote
ab=s′1−s1r1−r′1=t. | (3.3) |
Let's discuss in three cases according to whether √m1 and √m2 are rational numbers.
Case 1. √m1=c∈Q and √m2=d∈Q.
From Equation (3.3), it can be concluded that
ab=1c−1c√2+12−1√21d−1d√2+12−1√2=t, |
and we get t=d(c+2)c(d+2)=d(c+1)c(d+1). Furthermore, we have c=d, i.e., m1=m2, which contradicts with m1≠m2.
Case 2. √m1=c∈Q and √m2∈R−Q.
Subcase 2.1. √2m2=d∈Q.
From Equation (3.3), it can be concluded that
ab=1c−1c√2+12−1√21√m2−1d+12−1√2=t. |
Thus, we get t=d(c+2)c(d−2)=d(c+1)c(d−2), i.e., c+1=c+2, a contradiction.
Subcase 2.2. √2m2∈R−Q.
By Equation (3.3), we obtain
ab=1c−1c√2+12−1√21√m2−1√2m2+12−1√2=t, |
and we have t=c+2c=−√m2(c+1)(√2−√m2−1)c, which implies √2(2+c)−√m2−(2+c)=0, i.e., c=−2 and m2=0, a contradiction.
Case 3. √m1∈R−Q, √m2∈R−Q.
Subcase 3.1. √2m1=c∈Q, √2m2∈R−Q.
By Equation (3.3), we obtain
ab=1√m1−1c+12−1√21√m2−1√2m2+12−1√2=t. |
Then we have t=c−2c=√2m2(√2−√m1)c(√2−√m2−1), i.e., m1=2, which contradicts with m1≥3.
Subcase 3.2. √2m1∈R−Q, √2m2∈R−Q.
By Equation (3.3), we obtain
ab=1√m1−1√2m1+12−1√21√m2−1√2m2+12−1√2=t. |
Similarly, it can be concluded that t=1=1√m1−1√2m11√m2−1√2m2, i.e., m1=m2, which contradicts with m1≠m2.
Therefore, taking into account the above situations, we obtain that r1=r′1 and s1=s′1, except for the case √m1,√m2∈R−Q and √2m1,√2m2∈Q.
Next, We will extend this result to Rh(T), where h≥2.
Let u0 and v0 be the m1-vertex and m2-vertex of T (see Figure 1). Let Ph represent the set of all paths of length h in T, N={0,1,2,⋯} as the set of natural numbers and the function Ψ:Ph⟶Nh+1 by Ψ(π)=(v1(π),⋯,vh+1(π)), where vi(π) denotes the degree of the i-th vertex of the path π.
We first consider all paths in Ph that contain u0 or v0 as an end-vertex, or do not contain u0 and v0. There are twelve possibilities for the images under Ψ of these paths:
X1=(1,2,⋯,2⏟h−1,m1),X′1=(1,2,⋯,2⏟h−1,m2), X2=(2,⋯,2⏟h,m1),X′2=(2,⋯,2⏟h,m2), X3=(2,⋯,2⏟h+1),X′3=(2,⋯,2⏟h+1), X4=(1,2,⋯,2⏟h),X′4=(1,2,⋯,2⏟h), X5=(1,2,⋯,2⏟h−2,m1,m2),X′5=(1,2,⋯,2⏟h−2,m2,m1), X6=(2,⋯,2⏟h−1,m1,m2),X′6=(2,⋯,2⏟h−1,m2,m1). |
We then consider all paths in Ph that contain only one of u0 and v0, but not as an end-vertex. In this case the image of Ψ is as follows:
Y1(a)=(1,2,⋯,2⏟a,m1,2,⋯,2⏟h−1−a),Y′1(a)=(1,2,⋯,2⏟a,m2,2,⋯,2⏟h−1−a), where 0≤a≤h−2.
Y2(a)=(1,2,⋯,2⏟a,m1,2,⋯,2⏟h−2−a,1),Y′2(a)=(1,2,⋯,2⏟a,m2,2,⋯,2⏟h−2−a,1), where 0≤a≤h2−1.
Y3(a)=(2,⋯,2⏟a,m1,2,⋯,2⏟h−a),Y′3(a)=(2,⋯,2⏟a,m2,2,⋯,2⏟h−a), where 1≤a≤h2.
Finally, consider all paths in Ph that contain both v0 and u0, but not one as an end-vertex. In this case the image of Ψ is as follows:
Z1(a)=(1,2,⋯,2⏟a,m1,m2,2,⋯,2⏟h−2−a),Z′1(a)=(1,2,⋯,2⏟a,m2,m1,2,⋯,2⏟h−2−a), where 0≤a≤h−3.
Z2(a)=(1,2,⋯,2⏟a,m1,m2,2,⋯,2⏟h−3−a,1), where 0≤a≤h−3.
Z3(a)=(2,⋯,2⏟a,m1,m2,2,⋯,2⏟h−1−a), where 1≤a≤h−2.
Now, let's prove our main result.
Theorem 3.3. Let T∈Ωn,m1,m2, where m1≠m2. Then
Rh(T)=(1√2h−1m1−1√2hm1+1√2h+1−1√2h)rh+(1√2h−1m2−1√2hm2 +1√2h+1−1√2h)sh+λ(h,n,m1,m2,r1,s1,⋯,rh−1,sh−1), |
where λ(h,n,m1,m2,r1,s1,⋯,rh−1,sh−1) is a real number determined by the values of h,n,m1, m2,⋯,rh−1,sh−1.
Proof. Clearly, Rh(T) is determined by the numbers |Ψ−1(Xi)|, |Ψ−1(X′i)|, |Ψ−1(Yi(a))|, |Ψ−1(Y′i(a))|, |Ψ−1(Zi(a))| and |Ψ−1(Z′i(a))|, where |Ψ−1(W)| represents the number of elements in the inverse image of W under Ψ, i.e.,
Rh(T)=|Ψ−1(X1)|1√2h−1m1+|Ψ−1(X′1)|1√2h−1m2+|Ψ−1(X2)|1√2hm1+|Ψ−1(X′2)|1√2hm2 +|Ψ−1(X3)|1√2h+1+|Ψ−1(X′3)|1√2h+1+|Ψ−1(X4)|1√2h+|Ψ−1(X′4)|1√2h +|Ψ−1(X5)|1√2h−2m1m2+|Ψ−1(X′5)|1√2h−2m1m2+|Ψ−1(X6)|1√2h−1m1m2 +|Ψ−1(X′6)|1√2h−1m1m2+h−2∑a=0|Ψ−1(Y1(a))|1√2h−1m1+h−2∑a=0|Ψ−1(Y′1(a))|1√2h−1m2 +h2−1∑a=0|Ψ−1(Y2(a))|1√2h−2m1+h2−1∑a=0|Ψ−1(Y′2(a))|1√2h−2m2+h2∑a=1|Ψ−1(Y3(a))|1√2hm1 +h2∑a=1|Ψ−1(Y′3(a))|1√2hm2+h−3∑a=0|Ψ−1(Z1(a))|1√2h−2m1m2+h−3∑a=0|Ψ−1(Z′1(a))|1√2h−2m1m2 +h−3∑a=0|Ψ−1(Z2(a))|1√2h−3m1m2+h−2∑a=1|Ψ−1(Z3(a))|1√2h−1m1m2. |
We can express |Ψ−1(Xi)|, |Ψ−1(X′i)|, |Ψ−1(Yi(a))|, |Ψ−1(Y′i(a))|, |Ψ−1(Zi(a))| and |Ψ−1(Z′i(a))| in terms of r1,s1,⋯,rh,sh by a counting argument together with the reduction formulas as follows:
|Ψ−1(X1)|=rh,|Ψ−1(X′1)|=sh, |Ψ−1(X2)|=rh+1+⋯+rt1=m1−1−h∑i=1ri,|Ψ−1(X′2)|=m2−1−h∑i=1si, |Ψ−1(X3)|=rh+1+2rh+2+⋯+(t−h−1)rt1=−(h+1)t1∑i=h+1ri+t1∑i=h+1iri, =−(h+1)[m1−1−h∑i=1ri]+[n1−1−h∑i=1iri], |Ψ−1(X′3)|=−(h+1)[m2−1−h∑i=1si]+[n2−1−h∑i=1isi],wheren1+n2=n, |Ψ−1(X4)|=m1−1−h∑i=1ri,|Ψ−1(X′4)|=m2−1−h∑i=1si, |Ψ−1(X5)|=rh−1,|Ψ−1(X′5)|=sh−1, |Ψ−1(X6)|=rh+⋯+rt1=m1−1−h−1∑i=1ri,|Ψ−1(X′6)|=m1−1−h−1∑i=1si, |
|Ψ−1(Y1(a))|={ra+1(m1−1−h−1−a∑i=1ri),if0≤a<h−12,ra+1(m1−2−h−1−a∑i=1ri),ifh−12≤a≤h−2. |
|Ψ−1(Y′1(a))|={sa+1(m2−1−h−1−a∑i=1si),if0≤a<h−12,sa+1(m2−2−h−1−a∑i=1si),ifh−12≤a≤h−2. |
|Ψ−1(Y2(a))|={ra+1rh−1−a,if0≤a<h2−1,12ra+1(ra+1−1),ifa=h2−1. |
|Ψ−1(Y′2(a))|={sa+1sh−1−a,if0≤a<h2−1,12sa+1(sa+1−1),ifa=h2−1. |
|Ψ−1(Y3(a))|={[m1−1−h−a∑i=1ri][m1−2−a∑i=1ri],if1≤a≤h−12,12[m1−1−h−a∑i=1ri][m1−2−a∑i=1ri],ifa=h2. |
|Ψ−1(Y′3(a))|={[m2−1−h−a∑i=1si][m2−2−a∑i=1si],if1≤a≤h−12,12[m2−1−h−a∑i=1si][m2−2−a∑i=1si],ifa=h2. |
|Ψ−1(Z1(a))|=ra+1(m2−1−h−2−a∑i=1si),if0≤a≤h−3, |Ψ−1(Z′1(a))|=sa+1(m1−1−h−2−a∑i=1ri),if0≤a≤h−3, |Ψ−1(Z2(a))|=ra+1sh−2−a,if0≤a≤h−3, |Ψ−1(Z3(a))|=(m1−1−a∑i=1ri)(m2−1−h−1−a∑i=1si),if1≤a≤h−2. |
We can see that |Ψ−1(Xi)|, |Ψ−1(X′i)|, |Ψ−1(Yj(a))|, |Ψ−1(Y′j(a))|, |Ψ−1(Zj(a))| and |Ψ−1(Z′j(a))| depend on the numbers h,m,r1,s1,⋯,rh−1,sh−1 for all a and i=5,6 andj=1,2,3; while for i=1,2,3,4, |Ψ−1(Xi)| and |Ψ−1(X′i)| depend on the numbers h,m,r1,s1,⋯,rh,sh. Hence, by grouping in a convenient way we can get
Rh(T)=λ(h,n,m1,m2,r1,s1,⋯,rh−1,sh−1)+μ(h,m1,m2,rh,sh), |
where λ(h,n,m1,m2,r1,s1,⋯,rh−1,sh−1) is a real number determined by the values of h,n,m1, m2,r1,s1,⋯,rh−1,sh−1, and
μ(h,m1,m2,rh,sh)=(1√2h−1m1−1√2hm1+1√2h+1−1√2h)rh +(1√2h−1m2−1√2hm2+1√2h+1−1√2h)sh. |
Thus, the theorem holds.
Example 3.4. Let T∈Ω18,7,4 with r1(T)=3, r2(T)=2, r3(T)=1, s1(T)=2 and s4(T)=1, where m1=7,m2=4. In order to calculate R3(T), we first determine the number of paths of each type:
|Ψ−1(X1)|=r3=1,|Ψ−1(X′1)|=s3=0, |Ψ−1(X2)|=m1−1−3∑i=1ri=0,|Ψ−1(X′2)|=1, |Ψ−1(X3)|=−(3+1)[m1−1−3∑i=1ri]+[n1−1−3∑i=1iri]=0,|Ψ−1(X′3)|=0, |Ψ−1(X4)|=m1−1−3∑i=1ri=0,|Ψ−1(X′4)|=1, |Ψ−1(X5)|=r2=2,|Ψ−1(X′5)|=s2=0, |Ψ−1(X6)|=m1−1−2∑i=1ri=1,|Ψ−1(X′6)|=1, |Ψ−1(Y1(0))|=r1(m1−1−2∑i=1ri)=3,|Ψ−1(Y1(1))|=r2(m1−2−r1)=4, |Ψ−1(Y′1(0))|=s1(m2−1−2∑i=1si)=2,|Ψ−1(Y′1(1))|=s2(m2−2−s1)=0, |Ψ−1(Y2(0))|=r1r2=6,|Ψ−1(Y′2(0))|=0, |Ψ−1(Y3(1))|=[m1−1−2∑i=1ri][m1−2−r1]=2,|Ψ−1(Y′3(1))|=0, |Ψ−1(Z1(0))|=r1(m2−1−s1)=3,|Ψ−1(Z′1(0))|=s1(m1−1−r1)=6, |Ψ−1(Z2(0))|=r1s1=6,|Ψ−1(Z3(1))|=(m1−1−r1)(m2−1−s1)=3. |
Hence, we obtain from Theorem 3.3
R3(T)=1√28+01√16+01√56+11√32+01√16+01√16+01√8+1√8+21√56 +01√56+1√112+1√112+(3+4)1√28+(2+0)1√16+61√14+01√8 +21√56+01√32+31√56+61√56+61√28+31√112 =12+12√2+14√2+(7+54)1√7+(6+132)1√14. |
Theorem 3.5. Let T,T′∈Ωn,m1,m2, where m1≠m2. Then T and T′ are isomorphic if and only if
(i) Rh(T)=Rh(T′) for all h≥0, where min{m1,m2}=2; or
(ii) Rh(T)=Rh(T′) for all h≥0, where m1,m2≥3, except for the case √m1,√m2∈R−Q and √2m1,√2m2∈Q.
Proof. The necessity is clear, we only need to prove sufficiency. Assume that T,T′∈Ωn,m1,m2. Since R0(T)=R0(T′), by Theorem 3.1, m1=m′1 and m2=m′2. Now, from R1(T)=R1(T′) and Theorem 3.2, we have r1=r′1 and s1=s′1, where min{m1,m2}=2, or where m1,m2≥3, except for the case √m1,√m2∈R−Q and √2m1,√2m2∈Q. Next, applying Theorem 3.3 for h=2, we get
(1√21m1−1√22m1+1√23−1√22)r2+(1√21m2−1√22m2+1√23−1√22)s2+λ =(1√21m1−1√22m1+1√23−1√22)r′2+(1√21m2−1√22m2+1√23−1√22)s′2+λ |
i.e.,
(1√m1−1√2m1+12−1√2)r2+(1√m2−1√2m2+12−1√2)s2 =(1√m1−1√2m1+12−1√2)r′2+(1√m2−1√2m2+12−1√2)s′2 |
By a proof process similar to Theorem 3.2, we have r2=r′2 and s2=s′2. Continuing this process by repeated use of Theorem 3.3 and Theorem 3.2, we can conclude that ri=r′i and si=s′i for all i∈N. Therefore, T and T′ are isomorphic.
Finally, let T∈Ωn,m1,m2. If min{m1,m2}=2, then T is a starlike tree, i.e., T∈Ωn,m, where m=max{m1,m2}. From Theorem 3.3 and Theorem 3.5, we have the following corollaries which are given in [14].
Corollary 3.6. [14] Let T∈Ωn,m. Then
Rh(T)=(1√2h−1m−1√2hm+1√2h+1−1√2h)sh+λ(h,n,m,s1,⋯,sh−1), |
where λ(h,n,m,s1,⋯,sh−1) is a real number determined by the values of h,n,m,s1,⋯,sh−1.
Corollary 3.7. [14] Let T,T′∈Ωn,m. Then T and T′ are isomorphic if and only if Rh(T)=Rh(T′) for all h≥0.
In this paper, we mainly investigated the hth order Randić index Rh(T) of the double starlike tree T, which is a tree with two vertices of degrees m1,m2>2. First, the formula of the hth order Randić index Rh(T) has been completely determined by its branches of length ≤h. Second, it was taken that m1≠m2, and we have shown that almost all the double starlike trees T∈Ωn,m1,m2 with equal h-Randić index for all h≥0 are isomorphic. In addition, some results of starlike trees have been obtained, which were given in [14].
These results lead to a natural question, which we pose as a problem.
Problem 3.8. Which index can determine isomorphism of double starlike trees T∈Ωn,m1,m2, where m1=m2?
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work is supported by the Department of Education of Hunan Province (22B0763), (22B0828), the National Natural Science Foundation of China (12201634), and the Natural Science Foundation of Hunan Province (2023JJ30070).
The authors declare that they have no conflicts of interest.
[1] |
D. Plavaic, S. Nikolic, N. Trinajstic, Z. Mihalic, On the Harary index for the characterization of chemical graphs, J. Math. Chem., 12 (1993), 235–250. https://doi.org/10.1007/BF01164638 doi: 10.1007/BF01164638
![]() |
[2] |
N. Ghareghani, F, Ramezani, B. Tayfeh-Rezaie, Graphs cospectral with starlike trees, Lin. Alg. Appl., 429 (2008), 2691–2701. https://doi.org/10.1016/j.laa.2008.01.001 doi: 10.1016/j.laa.2008.01.001
![]() |
[3] |
O. Araujo, J. A. de la Peña, The connectivity index of a weighted graph, Lin. Alg. Appl., 283 (1998), 171–177. https://doi.org/10.1016/S0024-3795(98)10096-4 doi: 10.1016/S0024-3795(98)10096-4
![]() |
[4] |
I. Gutman, M. Randić, Algebraic characterization of skeletal branching, Chem. Phys. Lett., 47 (1977), 15–19. https://doi.org/10.1016/0009-2614(77)85296-2 doi: 10.1016/0009-2614(77)85296-2
![]() |
[5] | M. Randić, On the characterization of molecular branching, J. Am. Chem. Soc., 97 (1975), 6609–6615. |
[6] | L. B. Kier, L. H. Hall, Molecular connectivity in structure-activity analysis, New York: Wiley Press, 1986. |
[7] |
J. Du, Y. Shao, X. Sun, The zeroth-order general Randić index of graph with a given clique number, Korean J. Math., 28 (2020), 405–419. https://doi.org/10.11568/KJM.2020.28.3.405 doi: 10.11568/KJM.2020.28.3.405
![]() |
[8] |
I. Gutman, Some less familiar properties of Randić index, Croatica Chemica Acta, 93 (2021), 273–278. https://doi.org/10.5562/cca3747 doi: 10.5562/cca3747
![]() |
[9] |
B. Furtula, A. Graovac, D, Vukicevic, Atom-bond connectivity index of trees, Discrete Appl. Math., 157 (2009), 2828–2835. https://doi.org/10.1016/j.dam.2009.03.004 doi: 10.1016/j.dam.2009.03.004
![]() |
[10] | L. Volkmann, Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected digraphs, Communications in Combinatorics and Optimization, 1 (2016), 1–13. |
[11] |
I. G. Yero, J. A. Rodríguez-Velázquez, I. Guyman, Estimating the higher-order Randić index, Chem. Phys. Lett., 489 (2010), 118–120. https://doi.org/10.1016/j.cplett.2010.02.052 doi: 10.1016/j.cplett.2010.02.052
![]() |
[12] |
O. Araujo, J. Rada, Randić index and lexicographic order, J. Math. Chem., 27 (2000), 201–212. https://doi.org/10.1023/A:1026424219580 doi: 10.1023/A:1026424219580
![]() |
[13] |
M. Randić, Representation of molecular graphs by basic graphs, J. Chem. Inf. Comput. Sci., 32 (1992), 57–69. https://doi.org/10.1021/ci00005a010 doi: 10.1021/ci00005a010
![]() |
[14] |
J. Rada, O. Araujo, Higher order connectivity index of starlike trees, Discrete Appl. Math., 119 (2002), 287–295. https://doi.org/10.1016/S0166-218X(01)00232-3 doi: 10.1016/S0166-218X(01)00232-3
![]() |
[15] |
R. Song, Q. Huang, A relation on trees and the topological indices based on subgraph, MATCH Commun. Math. Comput. Chem., 89 (2023), 343–370. https://doi.org/10.46793/match.89-2.343S doi: 10.46793/match.89-2.343S
![]() |