Next Article in Journal
The Biological and Biophysical Properties of the Spider Peptide Gomesin
Next Article in Special Issue
Theoretical Prediction of the Complex P-Glycoprotein Substrate Efflux Based on the Novel Hierarchical Support Vector Regression Scheme
Previous Article in Journal
Solvent Extraction and Identification of Active Anticariogenic Metabolites in Piper cubeba L. through 1H-NMR-Based Metabolomics Approach
Previous Article in Special Issue
Causal Discovery Combining K2 with Brain Storm Optimization Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices

1
Key Laboratory of Pattern Recognition and Intelligent Information Processing, Institutions of Higher Education of Sichuan Province, Chengdu University, Chengdu 610106, China
2
School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
3
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
*
Author to whom correspondence should be addressed.
Molecules 2018, 23(7), 1731; https://doi.org/10.3390/molecules23071731
Submission received: 25 May 2018 / Revised: 27 June 2018 / Accepted: 6 July 2018 / Published: 16 July 2018
(This article belongs to the Special Issue Molecular Computing and Bioinformatics)

Abstract

:
The Cartesian product and join are two classical operations in graphs. Let d L ( G ) ( e ) be the degree of a vertex e in line graph L ( G ) of a graph G . The edge versions of atom-bond connectivity ( A B C e ) and geometric arithmetic ( G A e ) indices of G are defined as e f E ( L ( G ) ) d L ( G ) ( e ) + d L ( G ) ( f ) 2 d L ( G ) ( e ) × d L ( G ) ( f ) and e f E ( L ( G ) ) 2 d L ( G ) ( e ) × d L ( G ) ( f ) d L ( G ) ( e ) + d L ( G ) ( f ) , respectively. In this paper, A B C e and G A e indices for certain Cartesian product graphs (such as P n P m , P n C m and P n S m ) are obtained. In addition, A B C e and G A e indices of certain join graphs (such as C m + P n + S r , P m + P n + P r , C m + C n + C r and S m + S n + S r ) are deduced. Our results enrich and revise some known results.

1. Introduction

The invariants based on the distance or degree of vertices in molecules are called topological indices. In theoretical chemistry, physics and graph theory, topological indices are the molecular descriptors that describe the structures of chemical compounds, and they help us to predict certain physico-chemical properties. The first topological index, Wiener index, was published in 1947 [1], and the edge version of the Wiener index was proposed by Iranmanesh et al. in 2009 [2]. Because the important effects of the topological indices are proved in chemical research, more and more topological indices are studied, including the classical atom-bond connectivity index and the geometric arithmetic index.
Let G be a simple connected graph. Denote by V ( G ) and E ( G ) the vertex set and edge set of G , respectively. Let P n , C n , K n and S n be a path, a cycle, a complete graph and a star, respectively, on n vertices. e = u v represents edge-connecting vertices u and v . N ( v ) is an open neighborhood of vertex v , i.e., N ( v ) = { u | u v E ( G ) } . Denote by d G ( v ) (simply d ( v ) ) the degree of vertex v of graph G , i.e., d ( v ) = | N ( v ) | . Let L ( G ) or G L be the line graph of G such that each vertex of L ( G ) represents an edge of G and two vertices of L ( G ) are adjacent if and only if their corresponding edges share a common endpoint in G [3]. It is known that the line graph L ( G ) of any graph G is claw-free. Denote by d L ( G ) ( e ) the degree of edge e in G , which is the number of edges sharing a common endpoint with edge e in G , or the degree of vertex e in L ( G ) . We denote by E n , m (or E n , m L ) the set of edges u v with degrees n and m of end vertices u and v in G (or in G L ), i.e., E n , m = { u v | { n , m } = { d ( u ) , d ( v ) } , u G , v G } or E n , m L = { u v | { n , m } = { d ( u ) , d ( v ) } , u L ( G ) , v L ( G ) } . The distance d G ( u , v ) (or d ( u , v ) for short) between u and v in G is the length of a shortest u v path.
The atom-bond connectivity (ABC) index was proposed by Estrada et al. in 1998 [4]. The ABC index is defined as:
A B C ( G ) = u v E ( G ) d G ( u ) + d G ( v ) 2 d G ( u ) × d G ( v )
where d G ( u ) and d G ( v ) are the degrees of the vertices u and v in G . Meanwhile, the edge version of the ABC index is:
A B C e ( G ) = e f E ( L ( G ) ) d L ( G ) ( e ) + d L ( G ) ( f ) 2 d L ( G ) ( e ) × d L ( G ) ( f )
where d L ( G ) ( e ) and d L ( G ) ( f ) are the degrees of the edges e and f , respectively, in G . The recent research on edge version ABC index can be referred to Gao et al. [5].
The geometric arithmetic (GA) index was proposed by Vukicevic and Furthla in 2009 [6]. The GA index is defined as
G A ( G ) = u v E ( G ) 2 d G ( u ) d G ( v ) d G ( u ) + d G ( v )
The edge version of the GA index was proposed by Mahmiani et al. [7] and is
G A e ( G ) = e f E ( L ( G ) ) 2 d L ( G ) ( e ) d L ( G ) ( f ) d L ( G ) ( e ) + d L ( G ) ( f )
Recent research on the edge-version GA index can be referred to the articles [5,8,9,10,11,12,13,14,15,16]. In addition, Das [17] obtained the upper and lower bounds of the ABC index of trees. Furtula et al. [18] found the chemical trees with extremal ABC values. Fath-Tabar et al. [19] obtained some inequalities for the ABC index of a series of graph operations. Chen et al. [20] obtained some upper bounds for the ABC index of graphs with given vertex connectivity. Das and Trinajstić [21] compared the GA and ABC indices for chemical trees and molecular graphs. Xing et al. [22] gave the upper bound for the ABC index of trees with perfect matching and characterized the unique extremal tree.
Based on the results, A B C e and G A e indices for certain Cartesian product graphs (such as P n P m , P n C m and P n S m ) are obtained. In addition, A B C e and G A e indices of certain join graphs (such as C m + P n + S r , P m + P n + P r , C m + C n + C r and S m + S n + S r ) are deduced. Our results extend and enrich some known results [5,23,24].

2. Main Results

It is known that the Cartesian product and join operation are very complicated. In this section, we present these two classical type of graphs.

2.1. Cartesian Product Graphs

In graph theory, the Cartesian product G H of graphs G and H is a graph such that the vertex set of G H is the Cartesian product V ( G ) × V ( H ) ; and any two vertices ( u , u ) and ( v , v ) are adjacent in G H if and only if either u = v and u are adjacent with v in H or u = v and u are adjacent with v in G . The graph P n P m and the line graph of P n P m are illustrated in Figure 1. In the following, we discuss the edge-version ABC and GA indices of some Cartesian product graphs.
Theorem 1. 
If n , m 4 , then
A B C e ( P n P m ) = 1 2 3 2 ( 2 n + 2 m 16 ) + 1 2 7 5 ( 4 n + 4 m 24 ) + 3 10 ( 6 n + 6 m 32 ) + 10 6 ( 6 n m 18 n 18 m + 52 ) + 8 2 5 + 4 5 3 + 8 2 5 + 8 3 ;
G A e ( P n P m ) = 6 n m 16 n 16 m + 4 5 9 ( 4 n + 4 m 24 ) + 2 30 11 ( 6 n + 6 m 32 ) + 44 + 16 12 7 + 2 15 .
Proof. 
Let G = P n P m , we have L ( G ) has 6 n m 6 n 6 m + 4 edges. Moreover, | E 3 , 3 L | = 4 , | E 3 , 4 L | = 8 , | E 3 , 5 L | = 8 , | E 4 , 4 L | = 2 n + 2 m 16 , | E 4 , 5 L | = 4 n + 4 m 24 , | E 5 , 5 L | = 4 , | E 5 , 6 L | = 6 n + 6 m 32 and | E 6 , 6 L | = 6 n m 18 n 18 m + 52 .
A B C e ( P n P m ) = ( 4 ) ( 3 + 3 2 3 × 3 ) + ( 8 ) ( 3 + 4 2 3 × 4 ) + ( 8 ) ( 3 + 5 2 3 × 5 ) + ( 2 n + 2 m 16 ) ( 4 + 4 2 4 × 4 ) + ( 4 n + 4 m 24 ) ( 4 + 5 2 4 × 5 ) + ( 4 ) ( 5 + 5 2 5 × 5 ) + ( 6 n + 6 m 32 ) ( 5 + 6 2 5 × 6 ) + ( 6 n m 18 n 18 m + 52 ) ( 6 + 6 2 6 × 6 ) = 1 2 3 2 ( 2 n + 2 m 16 ) + 1 2 7 5 ( 4 n + 4 m 24 ) + 3 10 ( 6 n + 6 m 32 ) + 10 6 ( 6 n m 18 n 18 m + 52 ) + 8 2 5 + 4 5 3 + 8 2 5 + 8 3 ;
G A e ( P n P m ) = ( 4 ) ( 2 3 × 3 3 + 3 ) + ( 8 ) ( 2 3 × 4 3 + 4 ) + ( 8 ) ( 2 3 × 5 3 + 5 ) + ( 2 n + 2 m 16 ) ( 2 4 × 4 4 + 4 ) + ( 4 n + 4 m 24 ) ( 2 4 × 5 4 + 5 ) + ( 4 ) ( 2 5 × 5 5 + 5 ) + ( 6 n + 6 m 32 ) ( 2 5 × 6 5 + 6 ) + ( 6 n m 18 n 18 m + 52 ) ( 2 6 × 6 6 + 6 ) = 6 n m 16 n 16 m + 4 5 9 ( 4 n + 4 m 24 ) + 2 30 11 ( 6 n + 6 m 32 ) + 44 + 16 12 7 + 2 15 .
By now, the proof is complete.
Theorem 2. 
If n 4 , m 3 , then
A B C e ( P n C m ) = 10 n m + ( 6 2 + 2 7 5 + 3 30 5 9 10 3 ) m
G A e ( P n C m ) = 6 n m + ( 2 + 16 5 9 + 12 30 11 18 ) m
Proof. 
Let G = P n C m , we have L ( G ) has 6 n m 6 m edges. Moreover, | E 4 , 4 L | = 2 m , | E 4 , 5 L | = 4 m , | E 5 , 6 L | = 6 m and | E 6 , 6 L | = 6 n m 18 m . In Figure 2, the degrees of vertices in line graph G L ( P n C m ) are displayed near the corresponding vertices.
A B C e ( P n C m ) = ( 2 m ) ( 4 + 4 2 4 × 4 ) + ( 4 m ) ( 4 + 5 2 4 × 5 ) + ( 6 m ) ( 5 + 6 2 5 × 6 ) + ( 6 n m 18 m ) ( 6 + 6 2 6 × 6 ) = 10 n m + ( 6 2 + 2 7 5 + 3 30 5 9 10 3 ) m ;
G A e ( P n C m ) = ( 2 m ) ( 2 4 × 4 4 + 4 ) + ( 4 m ) ( 2 4 × 5 4 + 5 ) + ( 6 m ) ( 2 5 × 6 5 + 6 ) + ( 6 n m 18 m ) ( 2 6 × 6 6 + 6 ) = 6 n m + ( 2 + 16 5 9 + 12 30 11 18 ) m .
In the end, the proof is complete.
Theorem 3. 
If n 5 , m 1 , then
A B C e ( P n S m ) = ( n 2 ) ( m 1 ) ( m 2 ) 2 ( m + 2 ) 2 m + 2 + ( n 3 ) ( m 1 ) ( m + 4 m + 2 + 2 3 2 ( m + 2 ) ) + 2 ( m 1 ) ( m + 3 3 ( m + 2 ) + 3 m 1 ( m + 2 ) ( 2 m 1 ) + m + 1 3 m + 3 m 3 m ( 2 m 1 ) ) + ( m 1 ) ( m 2 ) m 2 m 2 + 1 4 ( m 1 ) ( n 4 ) 6 + ( m 1 ) 5 3 + n 4 2 m 4 m 2 + 2 4 m 3 2 m ( 2 m 1 ) ;
G A e ( P n S m ) = ( n 2 ) ( m 1 ) ( m 2 ) 2 + 8 ( n 3 ) ( m 1 ) ( m + 2 ) m + 6 + 4 ( m 1 ) 3 ( m + 2 ) m + 5 + 4 ( n 3 ) ( m 1 ) 2 m ( m + 2 ) 3 m + 2 + 4 ( m 1 ) ( m + 2 ) ( 2 m 1 ) 3 m + 1 + ( m 1 ) ( m 2 ) + 4 ( m 1 ) 3 m m + 3 + 4 ( m 1 ) m ( 2 m 1 ) 3 m 1 + ( m 1 ) ( n 4 ) + 8 ( m 1 ) 3 7 + ( n 4 ) + 4 2 m ( 2 m 1 ) 4 m 1 .
Proof. 
Let G = P n S m , we have L ( G ) has 1 2 ( m 2 n + m ( 7 n 10 ) 8 n + 8 ) edges. Moreover, | E m + 2 , m + 2 L | = ( n 2 ) ( m 1 ) ( m 2 ) 2 , | E m + 2 , 4 L | = 2 ( n 3 ) ( m 1 ) , | E m + 2 , 3 L | = 2 ( m 1 ) , | E m + 2 , 2 m L | = 2 ( n 3 ) ( m 1 ) , | E m + 2 , 2 m 1 L | = 2 ( m 1 ) , | E m , m L | = ( m 1 ) ( m 2 ) , | E m , 3 L | = 2 ( m 1 ) , | E m , 2 m 1 L | = 2 ( m 1 ) , | E 4 , 4 L | = ( m 1 ) ( n 4 ) , | E 3 , 4 L | = 2 ( m 1 ) , | E 2 m , 2 m L | = ( n 4 ) and | E 2 m 1 , 2 m L | = 2 . In Figure 3, the degrees of vertices in line graph G L ( P n S m ) are displayed near by the corresponding vertices.
A B C e ( P n S m ) = ( n 2 ) ( m 1 ) ( m 2 ) 2 ( m + 2 + m + 2 2 ( m + 2 ) × ( m + 2 ) ) + 2 ( n 3 ) ( m 1 ) ( m + 2 + 4 2 ( m + 2 ) × 4 ) + 2 ( m 1 ) ( m + 2 + 3 2 ( m + 2 ) × 3 ) + 2 ( n 3 ) ( m 1 ) ( m + 2 + 2 m 2 ( m + 2 ) × 2 m ) + 2 ( m 1 ) ( m + 2 + 2 m 1 2 ( m + 2 ) × ( 2 m 1 ) ) + ( m 1 ) ( m 2 ) ( m + m 2 m × m ) + 2 ( m 1 ) ( m + 3 2 m × 3 ) + 2 ( m 1 ) ( m + 2 m 1 2 m × ( 2 m 1 ) ) + ( m 1 ) ( n 4 ) ( 4 + 4 2 4 × 4 ) + 2 ( m 1 ) ( 3 + 4 2 3 × 4 ) + ( n 4 ) ( 2 m + 2 m 2 2 m × 2 m ) + 2 ( 2 m 1 + 2 m 2 ( 2 m 1 ) × 2 m ) = ( n 2 ) ( m 1 ) ( m 2 ) 2 ( m + 2 ) 2 m + 2 + ( n 3 ) ( m 1 ) ( m + 4 m + 2 + 2 3 2 ( m + 2 ) ) + 2 ( m 1 ) ( m + 3 3 ( m + 2 ) + 3 m 1 ( m + 2 ) ( 2 m 1 ) + m + 1 3 m + 3 m 3 m ( 2 m 1 ) ) + ( m 1 ) ( m 2 ) m 2 m 2 + 1 4 ( m 1 ) ( n 4 ) 6 + ( m 1 ) 5 3 + n 4 2 m 4 m 2 + 2 4 m 3 2 m ( 2 m 1 ) ;
G A e ( P n S m ) = ( n 2 ) ( m 1 ) ( m 2 ) 2 ( 2 ( m + 2 ) × ( m + 2 ) m + 2 + m + 2 ) + 2 ( n 3 ) ( m 1 ) ( 2 ( m + 2 ) × 4 m + 2 + 4 ) + 2 ( m 1 ) ( 2 ( m + 2 ) × 3 m + 2 + 3 ) + 2 ( n 3 ) ( m 1 ) ( 2 ( m + 2 ) × 2 m m + 2 + 2 m ) + 2 ( m 1 ) ( 2 ( m + 2 ) × ( 2 m 1 ) m + 2 + 2 m 1 ) + ( m 1 ) ( m 2 ) ( 2 m × m m + m ) + 2 ( m 1 ) ( 2 m × 3 m + 3 ) + 2 ( m 1 ) ( 2 m × ( 2 m 1 ) m + 2 m 1 ) + ( m 1 ) ( n 4 ) ( 2 4 × 4 4 + 4 ) + 2 ( m 1 ) ( 2 3 × 4 3 + 4 ) + ( n 4 ) ( 2 2 m × 2 m 2 m + 2 m ) + 2 ( 2 ( 2 m 1 ) × ( 2 m ) 2 m 1 + 2 m ) = ( n 2 ) ( m 1 ) ( m 2 ) 2 + 8 ( n 3 ) ( m 1 ) ( m + 2 ) m + 6 + 4 ( m 1 ) 3 ( m + 2 ) m + 5 + 4 ( n 3 ) ( m 1 ) 2 m ( m + 2 ) 3 m + 2 + 4 ( m 1 ) ( m + 2 ) ( 2 m 1 ) 3 m + 1 + ( m 1 ) ( m 2 ) + 4 ( m 1 ) 3 m m + 3 + 4 ( m 1 ) m ( 2 m 1 ) 3 m 1 + ( m 1 ) ( n 4 ) + 8 ( m 1 ) 3 7 + ( n 4 ) + 4 2 m ( 2 m 1 ) 4 m 1 .
Until now, the proof is complete.

2.2. Join Graph

The results of A B C e and G A e indices of P n , S n , K n and C n , which were first established by [7], as well as the A B C e and G A e indices of some join graphs, such as P n + C m , P n + S m , C m + P n + C m , S m + P n + S m and C m + P n + S r , created by P n , C n and S n were obtained by [5]. However, there are some problems in the calculation of the A B C e and G A e indices of join graph C m + P n + S r in [5].
The join graph operation’s definition is given as follows: If we are given two graphs G and H and two vertices v i V ( G ) , u j V ( H ) , the join graph is obtained by merging v i and u j into one vertex. The certain join graphs P n + C m and P n + S m are illustrated in Figure 4 and Figure 5, respectively.
Theorem A is stated in [5]. However, the result is not correct. In this paper, we correct the result of Theorem A and restate it in Theorem 4 as follows:
Theorem A. 
If n , r 4 , m 3 , then
A B C e ( C m + P n + S r ) = r 2 2 2 r 4 + ( r 1 ) 2 r 3 r ( r 1 ) + 2 2 ( n + m 3 ) + 2
G A e ( C m + P n + S r ) = 2 2 ( r 1 ) r + 1 + ( r 1 ) ( r 2 2 + 2 r ( r 1 ) 2 r 1 ) + n + m + 6 6 5 4
The join graph of C m + P n + S r is illustrated in Figure 6. It can be seen that d L ( G ) ( v n 2 v n 1 ) is 2 and d L ( G ) ( v n 1 v n ) is r in C m + P n + S r , so we have one edge of types d L ( G ) ( e ) = 2 and d L ( G ) ( f ) = r in G L ( C m + P n + S r ) .
Theorem 4. 
If n 4 , r 4 , m 3 , then we have
A B C e ( C m + P n + S r ) = r 2 2 2 r 4 + ( r 1 ) 2 r 3 r ( r 1 ) + 2 2 ( n + m 3 ) + 2
G A e ( C m + P n + S r ) = 2 2 r r + 2 + ( r 1 ) ( r 2 2 + 2 r ( r 1 ) 2 r 1 ) + n + m + 6 6 5 4
Proof. 
Let G = C m + P n + S r , we have | E 2 , 2 L | = n + m 7 , | E 2 , 3 L | = 3 , | E 2 , r L | = 1 , | E 3 , 3 L | = 3 , | E r 1 , r 1 L | = ( r 1 ) ( r 2 ) 2 and | E r 1 , r L | = r 1 .
A B C e ( C m + P n + S r ) = ( n + m 7 ) A B C e ( E 2 , 2 L ) + ( 3 ) A B C e L ( E 2 , 3 ) + ( 1 ) A B C e ( E 2 , r L ) + ( 3 ) A B C e ( E 3 , 3 L ) + ( r 1 ) ( r 2 ) 2 A B C e ( E r 1 , r 1 L ) + ( r 1 ) A B C e ( E r 1 , r L ) = ( n + m 7 ) ( 2 + 2 2 2 × 2 ) + ( 3 ) ( 2 + 3 2 2 × 3 ) + ( 1 ) ( 2 + r 2 2 × r ) + ( 3 ) ( 3 + 3 2 3 × 3 ) + ( r 1 ) ( r 2 ) 2 ( ( r 1 ) + ( r 1 ) 2 ( r 1 ) × ( r 1 ) ) + ( r 1 ) ( ( r 1 ) + r 2 ( r 1 ) × r ) = r 2 2 2 r 4 + ( r 1 ) 2 r 3 r ( r 1 ) + 2 2 ( n + m 3 ) + 2 .
Remark: The result of A B C e ( C m + P n + S r ) is the same as that of [5], only because the A B C e ( E 2 , r 1 L ) = A B C e ( E 2 , r L ) . We must note G A e ( E 2 , r 1 L ) G A e ( E 2 , r L ) .
G A e ( C m + P n + S r ) = ( n + m 7 ) G A e ( E 2 , 2 L ) + ( 3 ) G A e ( E 2 , 3 L ) + ( 1 ) G A e ( E 2 , r L ) + ( 3 ) G A e ( E 3 , 3 L ) + ( r 1 ) ( r 2 ) 2 G A e ( E r 1 , r L ) = ( n + m 7 ) ( 2 2 × 2 2 + 2 ) + ( 3 ) ( 2 2 × 3 2 + 3 ) + ( 1 ) ( 2 2 × r 2 + r ) + ( 3 ) ( 2 3 × 3 3 + 3 ) + ( r 1 ) ( r 2 ) 2 ( 2 ( r 1 ) × ( r 1 ) ( r 1 ) + ( r 1 ) ) + ( r 1 ) ( 2 ( r 1 ) × r ( r 1 ) + r ) = 2 2 r r + 2 + ( r 1 ) ( r 2 2 + 2 r ( r 1 ) 2 r 1 ) + n + m + 6 6 5 4 .
Now the proof is complete.
Theorem 5. 
If m 2 , n 2 , r 2 and P m + P n + P r be the join graphs depicted in Figure 7, then
A B C e ( P m + P n + P r ) = 2 2 ( m + n + r 4 )
G A e ( P m + P n + P r ) = m + n + r 6 + 4 3 2
.
Proof. 
Let G = P m + P n + P r , we have | E 2 , 2 L | = m + n + r 6 and | E 1 , 2 L | = 2 .
A B C e ( P m + P n + P r ) = ( m + n + r 6 ) A B C e ( E 2 , 2 L ) + 2 A B C e ( E 1 , 2 L ) = ( m + n + r 6 ) ( 2 + 2 2 2 × 2 ) + 2 ( 1 + 2 2 1 × 2 ) = 2 2 ( m + n + r 4 ) .
G A e ( P m + P n + P r ) = ( m + n + r 6 ) G A e ( E 2 , 2 L ) + 2 G A e ( E 1 , 2 L ) = ( m + n + r 6 ) ( 2 2 × 2 2 + 2 ) + 2 ( 2 1 × 2 1 + 2 ) = m + n + r 6 + 4 3 2 .
Now the proof is complete.
Theorem 6. 
Let m 3 , r 3 , n 6 and C m + C n + C r be the join graphs depicted in Figure 8. If d ( u m , v n ) 3 , then
A B C e ( C m + C n + C r ) = 2 2 ( m + n + r ) 2 2 + 3 6
G A e ( C m + C n + C r ) = m + n + r + 16 2 3
.
Proof. 
Let G = C m + C n + C r , we have | E 2 , 2 L | = m + n + r 12 , | E 2 , 4 L | = 8 and | E 4 , 4 L | = 12 .
A B C e ( C m + C n + C r ) = ( m + n + r 12 ) A B C e ( E 2 , 2 L ) + 8 A B C e ( E 2 , 4 L ) + 12 A B C e ( E 4 , 4 L ) = ( m + n + r 12 ) ( 2 + 2 2 2 × 2 ) + 8 ( 2 + 4 2 2 × 4 ) + 12 ( 4 + 4 2 4 × 4 ) = 2 2 ( m + n + r ) 2 2 + 3 6 .
G A e ( P m + P n + P r ) = ( m + n + r 12 ) G A e ( E 2 , 2 L ) + 8 G A e ( E 2 , 4 L ) + 12 G A e ( E 4 , 4 L ) = ( m + n + r 12 ) ( 2 2 × 2 2 + 2 ) + 8 ( 2 2 × 4 2 + 4 ) + 12 ( 2 4 × 4 4 + 4 ) = m + n + r + 16 2 3 .
Now the proof is complete.
Theorem 7. 
Let m 2 , n 3 , r 3 and S m + S n + S r be the join graphs depicted in Figure 9; then, we have
A B C e ( S m + S n + S r ) = ( m 1 ) 2 m + n 5 ( m 1 ) ( m + n 2 ) + ( n 2 ) m + 2 n 5 ( n 1 ) ( m + n 2 ) + ( n 2 ) 2 n + r 6 ( n 1 ) ( n + r 3 ) + ( r 2 ) n + 2 r 7 ( r 2 ) ( n + r 3 ) + ( m 2 ) 2 2 m 4 + ( n 2 ) ( n 3 ) 2 ( n 1 ) 2 n 4 + ( r 3 ) 2 2 r 6 + m + 2 n + r 7 ( m + n 2 ) ( n + r 3 ) ;
G A e ( S m + S n + S r ) = 2 ( m 1 ) ( m 1 ) ( m + n 2 ) 2 m + n 3 + 2 ( n 2 ) ( n 1 ) ( m + n 2 ) m + 2 n 3 + 2 ( n 2 ) ( n 1 ) ( n + r 3 ) 2 n + r 4 + 2 ( r 2 ) ( r 2 ) ( n + r 3 ) n + 2 r 5 + ( m 1 ) ( m 2 ) 2 + ( n 2 ) ( n 3 ) 2 + ( r 2 ) ( r 3 ) 2 + 2 ( m + n 2 ) ( n + r 3 ) m + 2 n + r 5 .
.
Proof. 
Let G = S m + S n + S r , we have | E m 1 , m + n 2 L | = m 1 , | E n 1 , m + n 2 L | = n 2 , | E n 1 , n + r 3 L | = n 2 , | E r 2 , n + r 3 L | = r 2 , | E m 1 , m 1 L | = ( m 1 ) ( m 2 ) 2 , | E n 1 , n 1 L | = ( n 2 ) ( n 3 ) 2 , | E r 2 , r 2 L | = ( r 2 ) ( r 3 ) 2 and | E m + n 2 , n + r 3 L | = 1 .
A B C e ( S m + S n + S r ) = ( m 1 ) A B C e ( E m 1 , m + n 2 L ) + ( n 2 ) A B C e ( E n 1 , m + n 2 L ) + ( n 2 ) A B C e ( E n 1 , n + r 3 L ) + ( r 2 ) A B C e ( E r 2 , n + r 3 L ) + ( m 1 ) ( m 2 ) 2 A B C e ( E m 1 , m 1 L ) + ( n 2 ) ( n 3 ) 2 A B C e ( E n 1 , n 1 L ) + ( r 2 ) ( r 3 ) 2 A B C e ( E r 2 , r 2 L ) + ( 1 ) A B C e ( E m + n 2 , n + r 3 L ) = ( m 1 ) ( m 1 ) + ( m + n 2 ) 2 ( m 1 ) ( m + n 2 ) + ( n 2 ) ( n 1 ) + ( m + n 2 ) 2 ( n 1 ) ( m + n 2 ) + ( n 2 ) ( n 1 ) + ( n + r 3 ) 2 ( n 1 ) ( n + r 3 ) + ( r 2 ) ( r 2 ) + ( n + r 3 ) 2 ( r 2 ) ( n + r 3 ) + ( m 1 ) ( m 2 ) 2 ( m 1 ) + ( m 1 ) 2 ( m 1 ) ( m 1 ) + ( n 2 ) ( n 3 ) 2 ( n 1 ) + ( n 1 ) 2 ( n 1 ) ( n 1 ) + ( r 2 ) ( r 3 ) 2 ( r 2 ) + ( r 2 ) 2 ( r 2 ) ( r 2 ) + ( 1 ) ( m + n 2 ) + ( n + r 3 ) 2 ( m + n 2 ) ( n + r 3 ) = ( m 1 ) 2 m + n 5 ( m 1 ) ( m + n 2 ) + ( n 2 ) m + 2 n 5 ( n 1 ) ( m + n 2 ) + ( n 2 ) 2 n + r 6 ( n 1 ) ( n + r 3 ) + ( r 2 ) n + 2 r 7 ( r 2 ) ( n + r 3 ) + ( m 2 ) 2 2 m 4 + ( n 2 ) ( n 3 ) 2 ( n 1 ) 2 n 4 + ( r 3 ) 2 2 r 6 + m + 2 n + r 7 ( m + n 2 ) ( n + r 3 ) .
G A e ( S m + S n + S r ) = ( m 1 ) G A e ( E m 1 , m + n 2 L ) + ( n 2 ) G A e ( E n 1 , m + n 2 L ) + ( n 2 ) G A e ( E n 1 , n + r 3 L ) + ( r 2 ) G A e ( E r 2 , n + r 3 L ) + ( m 1 ) ( m 2 ) 2 G A e ( E m 1 , m 1 L ) + ( n 2 ) ( n 3 ) 2 G A e ( E n 1 , n 1 L ) + ( r 2 ) ( r 3 ) 2 G A e ( E r 2 , r 2 L ) + ( 1 ) A B C e ( E m + n 2 , n + r 3 L ) = ( m 1 ) 2 ( m 1 ) ( m + n 2 ) ( m 1 ) + ( m + n 2 ) + ( n 2 ) 2 ( n 1 ) ( m + n 2 ) ( n 1 ) + ( m + n 2 ) + ( n 2 ) 2 ( n 1 ) ( n + r 3 ) ( n 1 ) + ( n + r 3 ) + ( r 2 ) 2 ( r 2 ) ( n + r 3 ) ( r 2 ) + ( n + r 3 ) + ( m 1 ) ( m 2 ) 2 2 ( m 1 ) ( m 1 ) ( m 1 ) + ( m 1 ) + ( n 2 ) ( n 3 ) 2 2 ( n 1 ) ( n 1 ) ( n 1 ) + ( n 1 ) + ( r 2 ) ( r 3 ) 2 2 ( r 2 ) ( r 2 ) ( r 2 ) + ( r 2 ) + ( 1 ) 2 ( m + n 2 ) ( n + r 3 ) ( m + n 2 ) + ( n + r 3 ) = 2 ( m 1 ) ( m 1 ) ( m + n 2 ) 2 m + n 3 + 2 ( n 2 ) ( n 1 ) ( m + n 2 ) m + 2 n 3 + 2 ( n 2 ) ( n 1 ) ( n + r 3 ) 2 n + r 4 + 2 ( r 2 ) ( r 2 ) ( n + r 3 ) n + 2 r 5 + ( m 1 ) ( m 2 ) 2 + ( n 2 ) ( n 3 ) 2 + ( r 2 ) ( r 3 ) 2 + 2 ( m + n 2 ) ( n + r 3 ) m + 2 n + r 5 .
Now the proof is complete.

3. Conclusions

The physical and chemical properties of proteins, DNAs and RNAs are very important for human disease and various approaches have been proposed to predict, validate and identify their structures and features [25,26]. Among these, topological indices were proved to be very helpful in testing the chemical properties of new chemical or physical materials such as new drugs or nanomaterials. Topological indices play an important role in studying the topological properties of chemical compounds, especially organic materials i.e., carbon containing molecular structures.
Various topological indices provide a better correlation for certain physico-chemical properties. Hence, the edge version ABC and GA indices for some special Cartesian product graphs and certain join graphs are described by graph structure analysis and a mathematical derivation method in this paper. The results of the current study also have promising prospects for applications in chemical and material engineering. The conclusions we draw here will not work for other classes of indices such as distance-based and distance adjacency-based topological indices. Thus a similar kind of study is needed for other classes of indices which might be a future direction in this area of mathematical chemistry.

Author Contributions

X.Z. contributes for conceptualization, designing the experiments and analyzed the data curation, he wrote the initial draft of the paper which were investigated and approved by Z.S. and J.-B.L. H.J. contribute for computing and performed experiments. J.-B.L. contributes for validation and formal analyzing. Z.S. contributes for supervision, funding and methodology and wrote the final draft. All authors read and approved the final version of the paper.

Funding

This work was supported by Applied Basic Research (Key Project) of the Sichuan Province under grant 2017JY0095, the key project of the Sichuan Provincial Department of Education under grant 17ZA0079 and 18ZA0118, the Soft Scientific Research Foundation of Sichuan Provincial Science and Technology Department (18RKX1048).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 7–20. [Google Scholar] [CrossRef]
  2. Iranmanesh, A.; Gutman, I.; Khormali, O.; Mahmiani, A. The edge versions of the wiener index. MATCH Commun. Math. Comput. Chem. 2009, 61, 663–672. [Google Scholar]
  3. Harary, F.; Norman, R.Z. Some properties of line digraphs. Rendiconti del Circolo Matematico di Palermo 1960, 9, 161–169. [Google Scholar] [CrossRef]
  4. Estrada, E.; Torres, L.; Rodriguez, L.; Gutman, I. An atom-bond connectivity index: Modelling the enthalpy of formation of Alkanes. Indian J. Chem. 1998, 37A, 849–855. [Google Scholar]
  5. Gao, W.; Farahani, M.; Wang, S.; Husin, M.N. On the edge-version atom-bond connectivity and geometric arithmetic indices of certain graph operations. Appl. Math. Comput. 2017, 308, 11–17. [Google Scholar] [CrossRef]
  6. Vukicevic, D.; Furtula, B. Topological index based on the ratios of geometric and arithmetical means of end-vertex degrees of edges. J. Math. Chem. 2009, 46, 1369–1376. [Google Scholar] [CrossRef]
  7. Mahmiani, A.; Khormali, O.; Iranmanesh, A. On the edge version of geometric-arithmetic index. Digest J. Nanomater. Biostruct. 2012, 7, 411–414. [Google Scholar]
  8. Liu, J.; Pan, X.; Yu, L.; Li, D. Complete characterization of bicyclic graphs with minimal Kirchhoff index. Discrete Appl. Math. 2016, 200, 95–107. [Google Scholar] [CrossRef]
  9. Liu, J.; Wang, W.; Zhang, Y.; Pan, X. On degree resistance distance of cacti. Discrete Appl. Math. 2016, 203, 217–225. [Google Scholar] [CrossRef]
  10. Li, X.L.; Shi, Y.T. A survey on the Randic’ index. MATCH Commun. Math. Comput. Chem. 2008, 59, 127–156. [Google Scholar]
  11. Randić, M. The connectivity index 25 years after. J. Mol. Graph. Modell. 2001, 20, 19–35. [Google Scholar] [CrossRef]
  12. Ma, J.; Shi, Y.; Wang, Z.; Yue, J. On Wiener polarity index of bicyclic networks. Sci. Rep. 2016, 6, 19066. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  13. Shi, Y. Note on two generalizations of the Randić index. Appl. Math. Comput. 2015, 265, 1019–1025. [Google Scholar] [CrossRef]
  14. Estes, J.; Wei, B. Sharp bounds of the Zagreb indices of k-trees. J. Comb. Optim. 2014, 27, 271–291. [Google Scholar] [CrossRef]
  15. Ji, S.; Wang, S. On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices. J. Math. Anal. Appl. 2018, 458, 21–29. [Google Scholar] [CrossRef] [Green Version]
  16. Zafar, S.; Nadeem, M.F.; Zahid, Z. On the edge version of geometric-arithmetic index of nanocones. Stud. Univ. Babes-Bolyai Chem. 2016, 61, 273–282. [Google Scholar]
  17. Das, K.C.; Trinajstić, N. Comparison between first geometric-arithmetic index and atom-bond connectivity index. Chem. Phys. Lett. 2010, 497, 149–151. [Google Scholar] [CrossRef]
  18. Furtula, B.; Graovac, A. Atom-bond connectivity index of trees. Discrete Appl. Math. 2009, 157, 2828–2835. [Google Scholar] [CrossRef]
  19. Fath-Tabar, G.H.; Vaez-Zadeh, B.; Ashrafi, A.R.; Graova, A. Some inequalities for the atom-bond connectivity index of graph operations. Discrete Appl. Math. 2011, 159, 1323–1330. [Google Scholar] [CrossRef]
  20. Chen, J.; Liu, J.; Guo, X. Some upper bounds for the atom-bond connectivity index of graphs. Appl. Math. Lett. 2012, 25, 1077–1081. [Google Scholar] [CrossRef]
  21. Das, K.C. Atom-bond connectivity index of graphs. Discrete Appl. Math. 2010, 158, 1181–1188. [Google Scholar] [CrossRef]
  22. Xing, R.; Zhou, B.; Du, Z. Further results on atom-bond connectivity index of trees. Discrete Appl. Math. 2010, 158, 1536–1545. [Google Scholar] [CrossRef]
  23. Shao, Z.; Wu, P.; Gao, Y.; Gutman, I.; Zhang, X. On the maximum ABC index of graphs without pendent vertices. Appl. Math. Comp. 2017, 315, 298–312. [Google Scholar] [CrossRef]
  24. Shao, Z.; Wu, P.; Zhang, X.; Dimitrov, D.; Liu, J. On the maximum ABC index of graphs with prescribed size and without pendent vertices. IEEE Access 2018, 6, 27604–27616. [Google Scholar] [CrossRef]
  25. Zeng, X.; Lin, W.; Guo, M.; Zou, Q. A comprehensive overview and evaluation of circular RNA detection tools. PLoS Comput. Biol. 2017, 13, e1005420. [Google Scholar] [CrossRef] [PubMed]
  26. Zeng, X.; Liao, Y.; Liu, Y.; Zou, Q. Prediction and validation of disease genes using HeteSim Scores. IEEE/ACM Trans. Comput. Biol. Bioinform. 2017, 14, 687–695. [Google Scholar] [CrossRef] [PubMed]
Figure 1. P n P m and the line graph of P n P m .
Figure 1. P n P m and the line graph of P n P m .
Molecules 23 01731 g001
Figure 2. G ( P n C m ) and G L ( P n C m ) .
Figure 2. G ( P n C m ) and G L ( P n C m ) .
Molecules 23 01731 g002
Figure 3. G ( P n S m ) and G L ( P n S m ) .
Figure 3. G ( P n S m ) and G L ( P n S m ) .
Molecules 23 01731 g003
Figure 4. The join graph of P n + C m .
Figure 4. The join graph of P n + C m .
Molecules 23 01731 g004
Figure 5. The join graph of P n + S m .
Figure 5. The join graph of P n + S m .
Molecules 23 01731 g005
Figure 6. The join graph of C m + P n + S r .
Figure 6. The join graph of C m + P n + S r .
Molecules 23 01731 g006
Figure 7. The join graph of P m + P n + P r .
Figure 7. The join graph of P m + P n + P r .
Molecules 23 01731 g007
Figure 8. The join graph of C m + C n + C r .
Figure 8. The join graph of C m + C n + C r .
Molecules 23 01731 g008
Figure 9. The join graph of S m + S n + S r .
Figure 9. The join graph of S m + S n + S r .
Molecules 23 01731 g009
Sample Availability: Not available.

Share and Cite

MDPI and ACS Style

Zhang, X.; Jiang, H.; Liu, J.-B.; Shao, Z. The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices. Molecules 2018, 23, 1731. https://doi.org/10.3390/molecules23071731

AMA Style

Zhang X, Jiang H, Liu J-B, Shao Z. The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices. Molecules. 2018; 23(7):1731. https://doi.org/10.3390/molecules23071731

Chicago/Turabian Style

Zhang, Xiujun, Huiqin Jiang, Jia-Bao Liu, and Zehui Shao. 2018. "The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices" Molecules 23, no. 7: 1731. https://doi.org/10.3390/molecules23071731

Article Metrics

Back to TopTop