Next Article in Journal
Absolute 3D Human Pose Estimation Using Noise-Aware Radial Distance Predictions
Next Article in Special Issue
Graphs of Wajsberg Algebras via Complement Annihilating
Previous Article in Journal
A New Design of a Terahertz Metamaterial Absorber for Gas Sensing Applications
Previous Article in Special Issue
Bounds on the General Eccentric Connectivity Index
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Gutman Connection Index of Graphs under Operations

1
Mathematics Department, College of Science, Jouf University, Sakaka P.O. Box 2014, Saudi Arabia
2
Department of Mathematics, School of Science, University of Management and Technology, Lahore 54770, Pakistan
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(1), 21; https://doi.org/10.3390/sym15010021
Submission received: 27 October 2022 / Revised: 9 December 2022 / Accepted: 15 December 2022 / Published: 22 December 2022

Abstract

:
In the modern era, mathematical modeling consisting of graph theoretic parameters or invariants applied to solve the problems existing in various disciplines of physical sciences like computer sciences, physics, and chemistry. Topological indices (TIs) are one of the graph invariants which are frequently used to identify the different physicochemical and structural properties of molecular graphs. Wiener index is the first distance-based TI that is used to compute the boiling points of the paraffine. For a graph F, the recently developed Gutman Connection (GC) index is defined on all the unordered pairs of vertices as the sum of the multiplications of the connection numbers and the distance between them. In this note, the G C index of the operation-based symmetric networks called by first derived graph D 1 ( F ) (subdivision graph), second derived graph D 2 ( F ) (vertex-semitotal graph), third derived graph D 3 ( F ) (edge-semitotal graph) and fourth derived graph D 4 ( F ) (total graph) are computed in their general expressions consisting of various TIs of the parent graph F, where these operation-based symmetric graphs are obtained by applying the operations of subdivision, vertex semitotal, edge semitotal and the total on the graph F respectively.

1. Introduction

A Topological index (TI) is a function from the set of graphs on the set of real numbers that associates a numeric number to each graph appearing in the set of graphs. If two graphs are isomorphic to each other, then the numeric values of the obtained TIs remain the same. Moreover, the computed values of the TIs predict the various physical and chemical properties of the understudy graphs, see [1]. In the subject of cheminformatics, TIs are also applied in the studies of the quantitative structures property and activity relationships, see [2,3,4].
In almost mid of the 20th century, Wiener (1947) [5] discovered a close correlation between the boiling point of paraffine (an alkane) and the sum of the distances between all the unordered pairs of vertices. Later on, this first distance-based mathematical expression is called the name of Wiener index. After the passage of a quarter of the century, Gutman and Trinajsti (1972) [6] discovered the first and second Zagreb indices. These degree-based TIs were utilized to determine the total π -electron energy of the molecules. These developments urged other mathematicians and chemists to develop new TIs for the study of the different chemical properties of molecular graphs (structures). In the class of distance-based TIs, the Gutman index and degree distance index are the most important applicable TIs, see [7,8]. For more details on degree and distance-based indices, we refer to [9,10,11].
In 2018, first Zagreb connection index ( Z C 1 ) , second Zagreb connection index ( Z C 2 ) and the modified first Zagreb connection index ( Z C 1 * ) were restudied by Ali and Trinajstic [12]. Later on, the connection distance (CD) index and Gutman connection (GC) index are studied in [13]. It is important to mention that the International Academy of Mathematical Chemistry (IAMC) declared that the Zagreb connection indices are better than the ordinary Zagreb indices for many physicochemical properties of chemical compounds existing in the molecular graphs. Moreover, Javaid et al. [14] presented a comparison of correlation coefficients between different TIs and confirmed that connection number-based indices are very useful TIs for the prediction of entropy, acentric factor, enthalpy of vaporization, and standard enthalpy of vaporization.
Four newly derived graphs are introduced by Yan et al. [15] by applying subdivision-related operations on a graph F and obtained first derived graph D 1 ( F ) (subdivided graph), second derived graph D 2 ( F ) (vertex-total graph), third derived graph D 3 ( F ) (edge-total graph) and the fourth derived graph D 3 ( F ) (total graph). Moreover, for the graphs obtained by different operations of graphs, the various TIs such as omega index [16], sombor index [17,18] and Zagreb indices and coindices [19,20] are computed. In particular, Xu et al. [21] and Bahadur et al. [22] computed the degree distance and Gutman indices of these derived graphs respectively. Recently, the connection distance index of derived graphs are computed in [23]. Motivated by this, in the present note, we computed exact and bounded values of the Gutman connection (GC) index on these derived graphs in the form of the various TIs of the parent graphs.

2. Preliminaries

A connected and simple graph F is taken into consideration throughout this article in which, V ( F ) = { a k : 1 k r } and E ( F ) = { η l : 1 m s } such that | V ( F ) | = r and | E ( F ) | = s . The most useful definitions are given below
  • The minimum number of consecutive edges that occurred between the two nodes a k and a m is called the distance between them and is denoted by λ ( a k , a m ) for 1 k , m r .
  • The cardinality of is N F 1 ( b ) = { a V ( F ) , λ ( a , b ) = 1 } is called the degree of node b of graph F and is denoted by Δ ( b ) .
  • The cardinality of N F 2 ( b ) = { a V ( F ) , λ ( a , b ) = 2 } is called the connection number of node b of graph F and is denoted by χ ( b ) .
  • Degree of an edge η k = a m a n is denoted by Δ ( η k ) and is equal to Δ ( a m ) + Δ ( a n ) 2 , where 1 k s for some 1 m , n r .
  • The minimum distance between the corresponding nodes of two edges η k = a x a y and η m = a z a w is called the distance between the two edges and is denoted by λ G ( η k , η m ) i.e., λ G ( η k , η m ) = m i n { λ F ( a x , a z ) , λ F ( a x , a w ) , λ F ( a y , a z ) , λ F ( a y , a w ) } , where 1 k , m s and 1 x , y , z , w r .
  • The distance between one edge η m = a x a y and one node a k is defined as
    λ F ( a k , η m ) = m i n { λ F ( a k , a x ) , λ F ( a k , a y ) } , where 1 j s and 1 i , x , y r .
More detailed knowledge can be obtained from [24,25,26]. Some related TIs are the followings:
Definition 1
([5]). Wiener index of a connected and simple graph F is
W ( F ) = 1 2 a k , a m V ( F ) λ F ( a k , a m ) .
Definition 2
([6]). First and second Zagreb index of a connected and simple graph F are defined as
M 1 ( F ) = a k a m E ( F ) [ Δ F ( a k ) + Δ F ( a m ) ] = a k V ( F ) [ Δ F ( a k ) ] 2 .
and
M 2 ( F ) = a k a m E ( F ) [ Δ F ( a k ) Δ F ( a m ) ] .
Definition 3
([27]). Edge version of Wiener index of a connected and simple graph F is defined as
W e ( F ) = { η k , η m } E ( F ) [ λ F ( η k , η m ) + 1 ] .
Definition 4
([7]). The degree distance index of a connected and simple graph F is
D D ( F ) = 1 2 a k , a m V ( F ) { λ F ( a k , a m ) ( Δ F ( a k ) + Δ F ( a m ) ) } .
The degree distance index of P n is D D ( P n ) = n ( n 1 ) ( 2 n 1 ) 3 .
Definition 5
([22]). Edge version of degree distance index of a connected and simple graph F is
D D e ( F ) = { η k , η m } E ( F ) [ λ e ( η k , η m ) + 1 ] [ Δ ( η k ) + Δ ( η m ) ) ] .
Definition 6
([8]). Gutman index of a connected and simple graph F is
G u t ( F ) = 1 2 a k , a m V ( F ) { λ F ( a k , a m ) ( Δ F ( a k ) Δ F ( a m ) ) } .
Definition 7
([22]). Edge version of Gutman index of a connected and simple graph F is
G u t e ( F ) = { η k , η m } E ( F ) [ λ e ( η k , η m ) + 1 ] [ Δ ( η k ) Δ ( η m ) ) ] .
Definition 8
([13]). Connection Distance (CD) of a connected and simple graph F is
C D ( F ) = { a k , a m } V ( F ) λ F ( a k , a m ) [ χ F ( a k ) + χ F ( a m ) ]
or
C D ( F ) = 1 2 a k , a m V ( F ) { λ F ( a k , a m ) ( χ F ( a k ) + χ F ( a m ) ) } .
Definition 9
([13]). Gutman Connection (GC) of a connected and simple graph F is defined as
G C ( F ) = { a k , a m } V ( F ) λ F ( a k , a m ) [ χ ( a k ) χ ( a m ) ]
or
G C ( F ) = 1 2 a k , a m V ( F ) { λ F ( a k , a m ) ( χ F ( a k ) χ F ( a m ) ) } .
Gutman index of P n is G M ( P n ) = ( n 1 ) ( 2 n 2 4 n + 3 ) 3 .
Edge version of P n is G u t e ( P n ) = G u t ( P n 1 ) = ( n 2 ) ( 2 n 2 8 n + 9 ) 3
C D ( P n ) = 2 n 3 6 n 2 + 10 n 12 3
G C ( P n ) = 2 n 3 12 n 2 + 34 n 42 3
D D ( C n ) = G M ( C n ) = G u t e ( C n ) = C D ( C n ) = G C ( C n ) = n 3 2 if n is even n ( n 2 1 ) 2 if n is odd a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Four new graphs were obtained from the four operations D 1 , D 2 , D 3 and D 4 on the graph F by Yan et al. [15] which are defined as follows:
  • First derived graph D 1 ( F ) is established from F when every edge η k = a m a n of F is upgraded by a path of length 2 by including a new node c k in it. The newly included nodes c k are also called white or new vertices while a m and a n are called old/black nodes.
  • Second derived graph D 2 ( F ) is established from D 1 ( F ) when a new node c k is again joined with the end nodes a m and a n of the respective edge η k .
  • Third derived graph D 3 ( F ) is established from D 1 ( F ) when two white nodes c k and c m are further joined together if their respective edges η k and η m have one common end node in graph F.
  • Fourth derived graph D 4 ( F ) is established from D 2 ( F ) when two white nodes c k and c m are further joined together if their respective edges η k and η m have one common end node in graph F.
Faiz Farid et al. [23] derived the relation between the connection numbers of derived graphs and the connection numbers or degrees of graphs in the following lemmas.
Lemma 1
([23]). Let D 1 ( F ) be first derived graph of connected and simple graph F. Then
  • (i) χ D 1 ( F ) ( a k ) = Δ ( F ) ( a k ) and
  • (ii) χ D 1 ( F ) ( c k ) = Δ ( F ) ( a m ) + Δ ( F ) ( a n ) 2 = Δ ( η k ) where c k is a white node with respective edge η k = a m a n .
Lemma 2
([23]). Let D 2 ( F ) be second derived graph of connected and simple graph F and
  • (a) If F is a { C 3 , C 4 } free graph, then
  • (i) χ D 2 ( F ) ( a k ) = 2 χ F ( a k ) and
  • (ii) χ D 2 ( F ) ( c k ) = 2 [ Δ F ( a m ) + Δ F ( a n ) ] 4 = 2 [ Δ F ( η k ) ]
  • (b) If F is a { C 3 , C 4 } graph, then
  • (i) χ D 2 ( F ) ( a k ) 2 χ F ( a k ) + p , where p = m a x { p k } and p k are number of C 3 and C 4 cycles joined with a k in F
  • (ii) χ D 2 ( F ) ( c k ) 2 [ Δ ( F ) ( a m ) + Δ ( F ) ( a n ) ] 4 q = 2 [ Δ ( F ) ( η k ) ] q , where q = m a x { q k } and q k are number of C 3 cycles joined with c k in F
Lemma 3
([23]). Let D 3 ( F ) be third derived graph of connected and simple graph F and
  • (a) If F is a { C 3 , C 4 } free graph, then
  • (i) χ D 3 ( F ) ( a i ) = Δ ( F ) ( a k ) + χ ( F ) ( a k ) and
  • (ii) χ D 3 ( F ) ( c k ) = χ ( F ) ( d k ) + χ ( F ) ( e k ) .
  • (b) If F is a { C 3 , C 4 } graph, then
  • (i) χ D 3 ( F ) ( a k ) Δ ( F ) ( a k ) + χ ( F ) ( a k ) + p where p = m a x { p k } and p k is the number of C 3 and C 4 cycles joined with vertex a i .
  • (ii) χ D 3 ( F ) ( c k ) χ ( F ) ( d k ) + χ ( F ) ( e k ) + q where q = m a x { q k } and q k is the number of C 3 cycles in graph F joined with edge η k .
Lemma 4
([23]). Let D 4 ( F ) be fourth derived graph of connected and simple graph F and
  • (a) If F is a { C 3 , C 4 } free graph, then
  • (i) χ D 4 ( F ) ( a k ) = 2 χ ( F ) ( a k ) and
  • (ii) χ D 4 ( F ) ( c k ) = χ ( F ) ( a m ) + χ ( F ) ( a n )
  • (b) If F is a { C 3 , C 4 } graph, then
  • (i) χ D 4 ( F ) ( a k ) 2 χ ( F ) ( a k ) + p where p = m a x { p k } and vertex a k is connected with p k number of C 3 and C 4 cycles and
  • (ii) χ D 4 ( F ) ( c k ) χ ( F ) ( a m ) + χ ( F ) ( a n ) + q where q = m a x { q k } and edge η k is connected with the q k number of C 3 cycles in graph F

3. Mian Results

This section covers the main results of the Gutman connection index on the four types of derived graphs.
Theorem 1.
Let D 1 ( F ) be first derived graph of connected and simple graph F, then
G C ( D 1 ( F ) ) = 2 G u t ( F ) + 2 G u t e ( F ) + m ( M 1 2 m ) + k = 1 r m = 1 s [ Δ ( a k ) Δ F ( η m ) ] λ G ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Proof. 
χ D 1 ( F ) ( a k ) = Δ F ( a k ) and χ D 1 ( F ) ( c k ) = Δ F ( a m ) + Δ F ( a n ) 2 = Δ D 1 ( F ) ( η i )
λ D 1 ( F ) ( a k , a m ) = 2 λ F ( a k , a m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
λ D 1 ( F ) ( c k , c m ) = 2 [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
λ D 1 ( F ) ( a k , c m ) = 2 λ F ( a k , η m ) + 1 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
G C ( D 1 ( F ) ) = { a k , a m } V ( F ) [ χ D 1 ( F ) ( a k ) χ D 1 ( F ) ( a m ) ] λ D 1 ( F ) ( a k , a m ) . a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a = 1 2 k , m = 1 r [ χ D 1 ( F ) ( a k ) χ D 1 ( F ) ( a m ) ] λ D 1 ( F ) ( a k , a m ) + 1 2 k , m = 1 s [ χ D 1 ( F ) ( c k ) χ D 1 ( F ) ( c m ) ] λ D 1 ( F ) ( c k , c m ) a a a a a a
a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ χ D 1 ( F ) ( a k ) χ D 1 ( F ) ( c m ) ] λ D 1 ( F ) ( a k , c m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a = 1 2 k , m = 1 r [ Δ F ( a k ) Δ F ( a m ) ] 2 λ F ( a k , a m ) + 1 2 k , m = 1 s [ Δ F ( η k ) Δ F ( η m ) ] 2 [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a
a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ Δ F ( a k ) Δ F ( η m ) ] [ 2 λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a = 2 G u t ( F ) + 2 G u t e ( F ) + 1 2 k = 1 r m = 1 s Δ F ( a k ) Δ F ( η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + k = 1 r m = 1 s [ Δ F ( a k ) Δ F ( η m ) ] λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a = 2 G u t ( F ) + 2 G u t e ( F ) + 1 2 ( k = 1 r [ Δ F ( a k ) ] ) ( m = 1 s [ Δ F ( η m ) ] ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + k = 1 r m = 1 s [ Δ F ( a k ) Δ F ( η m ) ] λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a = 2 G u t ( F ) + 2 G u t e ( F ) + s ( M 1 2 s ) + k = 1 r m = 1 s [ Δ F ( a k ) Δ F ( η m ) ] λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Theorem 2.
Let D 2 ( F ) be second derived graph of connected and simple graph F and
( a ) G C ( D 2 ( F ) ) 4 C D ( F ) + 2 p C D ( F ) + p 2 W ( F ) + 4 G u t e ( F ) + 2 ( M 1 2 s ) 2 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 2 k = 1 r m = 1 s χ F ( a k ) Δ F ( η m ) λ F ( a k , η m ) + r k = 1 r m = 1 s Δ F ( η m ) λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 2 ( M 1 2 s ) ( k = 1 r χ F ( a k ) ) + r p ( M 1 2 s ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
( b ) G C ( D 2 ( F ) ) 4 G C ( F ) + 4 G u t e ( F ) + 2 ( M 1 2 s ) 2 2 q D D e ( F ) 2 s q ( M 1 2 s ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + q 2 W e ( F ) + q 2 s 2 2 + 2 k = 1 r m = 1 s [ χ F ( a k ) Δ F ( η m ) ] λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a + 2 ( M 1 2 s ) k = 1 r χ F ( a k ) s k = 1 r m = 1 s [ χ F ( a k ) ( λ F ( a k , η m ) + 1 ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Proof. 
(a) For upper bounds, χ D 2 ( F ) ( a k ) 2 χ ( F ) ( a k ) + p and χ D 2 ( F ) ( c k ) = Δ ( F ) ( a m ) + Δ ( F ) ( a n ) 2 = Δ F ( η i )
Also λ D 2 ( F ) ( a k , a m ) = λ F ( a k , a m ) , for a k , a m V ( F )
λ D 2 ( F ) ( c k , c m ) = λ F ( η k , η m ) + 2 , for η k , η m E ( F )
λ D 2 ( F ) ( a k , c m ) = λ F ( a k , η m ) + 1 , for a k V ( F ) and η m E ( F )
G C ( D 2 ( F ) ) = { a k , a m } V ( G ) λ D 2 ( F ) ( a k , a m ) [ χ D 2 ( F ) ( a k ) χ D 2 ( F ) ( a m ) ] . a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a = 1 2 k , m = 1 r [ χ D 2 ( F ) ( a k ) χ D 2 ( F ) ( a m ) ] λ D 2 ( a k , a m ) + 1 2 k , m = 1 s [ χ D 2 ( F ) ( c k ) χ D 2 ( F ) ( c m ) ] λ D 2 ( F ) ( c k , c m ) a a a a a a a a
a a a a a + 1 2 k = 1 r m = 1 s [ χ D 2 ( F ) ( a k ) ] [ χ D 2 ( F ) ( c m ) ] λ D 2 ( F ) ( a k , c m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a 1 2 k , m = 1 r [ 2 χ F ( a k ) + p ] [ 2 χ F ( a m ) + p ] λ F ( a k , a m ) + 1 2 k , m = 1 s [ 2 Δ F ( η k ) ] [ 2 Δ F ( η m ) ] [ λ F ( η k , η m ) + 2 ] a a a a a a
a + 1 2 k = 1 r m = 1 s [ 2 χ F ( a k ) + p ] [ 2 Δ F ( η m ) ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a = 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] λ F ( a k , a m ) + p k , m = 1 r [ χ F ( a k ) + χ F ( a m ) ] λ F ( a k , a m ) a a a a a a a a a a a a a a a a a a a a a
a a + p 2 2 k , m = 1 r λ F ( a k , a m ) + 2 k , m = 1 s [ Δ F ( η k ) Δ F ( η m ) ] ( λ F ( η k , η m ) + 1 ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a + 2 k , m = 1 s [ Δ F ( η k ) Δ F ( η m ) ] + 2 k = 1 r m = 1 s χ F ( a k ) Δ F ( η m ) λ F ( a k , η m ) + p k = 1 r m = 1 s Δ F ( η m ) λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a
a + 2 k = 1 r m = 1 s χ F ( a k ) Δ F ( η m ) + p k = 1 r m = 1 s Δ F ( η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a = 4 G C ( F ) + 2 p C D ( F ) + p 2 W ( F ) + 4 G u t e ( F ) + 2 ( M 1 2 s ) 2 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a + 2 k = 1 r m = 1 s χ F ( a k ) Δ F ( η m ) λ F ( a k , η m ) + p k = 1 r m = 1 s Δ F ( η k ) λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a
a a + 2 ( k = 1 r χ F ( a k ) ( m = 1 s Δ F η m ) ) + p r ( M 1 2 s ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a = 4 G C ( F ) + 2 p C D ( F ) + p 2 W ( F ) + 4 G u t e ( F ) + 2 ( M 1 2 s ) 2 + a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a + 2 k = 1 r m = 1 s χ F ( a k ) Δ F ( η m ) λ F ( a k , η m ) + p k = 1 r m = 1 s Δ F ( η m ) λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a + 2 ( M 1 2 s ) ( k = 1 r χ F ( a k ) ) + p r ( M 1 2 s ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
(b) For lower bounds, χ D 2 ( F ) ( a k ) = 2 χ ( F ) ( a k ) and χ D 2 ( F ) ( c k ) = [ Δ ( F ) ( d k ) + Δ ( F ) ( e k ) 2 ] q = Δ F ( η k ) q
G C ( D 2 ( F ) ) = { a , b } V ( F ) [ χ D 2 ( F ) ( a ) χ D 2 ( F ) ( b ) ] λ D 2 ( F ) ( a , b ) . a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a = 1 2 k , m = 1 r [ χ D 2 ( F ) ( a k ) χ D 2 ( F ) ( a m ) ] λ D 2 ( F ) ( a k , a m ) + 1 2 k , m = 1 s [ χ D 2 ( F ) ( c k ) χ D 2 ( F ) ( c m ) ] [ λ D 2 ( F ) ( c k , c m ) + 1 ] a a a a a a
a a a a a a a a a + 1 2 k = 1 r m = 1 s [ χ D 2 ( F ) ( a k ) χ D 2 ( F ) ( c m ) ] λ D 2 ( F ) ( a k , c m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a 1 2 k , m = 1 r [ 2 χ F ( a k ) ] [ 2 χ F ( a m ) ] λ F ( a k , a m ) + 1 2 k , m = 1 s [ 2 Δ F ( η k ) q ] [ 2 Δ F ( η m ) q ] [ λ F ( η k , η m ) + 2 ] a a a a a a
a a a a a a a + 1 2 k = 1 r m = 1 s [ 2 χ F ( a k ) ] [ 2 Δ F ( η m ) q ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a = 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] λ F ( a k , a m ) + 2 k , m = 1 s [ Δ F ( η k ) Δ F ( η m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a
a a a a a a a a a a a a a a + 2 k , m = 1 s [ Δ F ( η k ) Δ F ( η m ) ] q k , m = 1 s [ Δ F ( η k ) + Δ F ( η m ) ] ( λ F ( η k , η m ) + 1 ) q k , m = 1 s [ Δ F ( η k ) + Δ F ( η m ) ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a + q 2 2 k , m = 1 s ( λ F ( η k , η m ) + 1 ) + q 2 2 k , m = 1 s + 2 k = 1 r m = 1 s [ χ F ( a k ) Δ G ( η m ) ] λ F ( a k , η m ) a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a + 2 k = 1 r m = 1 s χ F ( a k ) Δ F ( η m ) q k = 1 r m = 1 s [ χ F ( a k ) ( λ F ( a k , η m ) + 1 ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a = 4 G C ( F ) + 4 G u t e ( F ) + 2 ( M 1 2 s ) 2 2 q D D e ( F ) 2 s q ( M 1 2 s ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a + q 2 W e ( F ) + q 2 s 2 2 + 2 k = 1 r m = 1 s [ χ F ( a k ) Δ F ( η m ) ] λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a + 2 ( M 1 2 s ) k = 1 r χ F ( a k ) q k = 1 r m = 1 s [ χ F ( a k ) ( λ F ( a k , η m ) + 1 ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Corollary 1.
If F be a { C 3 , C 4 } free graph, then
G C ( D 2 ( F ) ) = 4 G C ( F ) + 4 G u t e ( F ) + 2 ( M 1 2 s ) 2 + 2 k = 1 r m = 1 s [ χ F ( a k ) Δ F ( η m ) ] λ F ( a k , η m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 2 ( M 1 2 s ) k = 1 r χ F ( a k ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Proof. 
By taking r = 0 and s = 0 , we can get the required result. □
Theorem 3.
Let D 3 ( F ) be third derived graph of connected and simple graph F and
G C ( D 3 ( F ) ) G u t ( F ) + G C ( F ) + p 2 W ( F ) + p D D ( F ) + p C D ( F ) + 2 r 2 s 2 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] [ λ F ( a k , a m ) ] + 2 p r s a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] + p 2 k , m = 1 r [ χ F ( a k ) + χ F ( a m ) ] + p 2 r 2 2 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] + q 2 W e ( F ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + q 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) + χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e m ) ] [ χ F ( d k ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ Δ F ( a k ) + χ F ( a k ) + p ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Proof. 
χ D 3 ( F ) ( a k ) Δ F ( a k ) + χ F ( a k ) + p and χ D 3 ( F ) ( c k ) χ ( F ) ( d k ) + χ ( F ) ( e k ) + q
λ D 3 ( F ) ( a , b ) = λ F ( a , b ) + 1 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
λ D 3 ( F ) ( c k , c m ) = λ F ( η k , η m ) + 1 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
λ D 3 ( F ) ( a k , c m ) = λ F ( a k , η m ) + 1 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
G C ( D 3 ( F ) ) = { a , b } V ( F ) [ χ D 3 ( F ) ( a ) χ D 3 ( F ) ( b ) ] λ D 3 ( a , b ) . a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a = 1 2 k , m = 1 r [ χ D 3 ( F ) ( a k ) χ D 3 ( F ) ( a m ) ] λ D 3 ( F ) ( a k , a m ) + 1 2 k , m = 1 s [ χ ( c k ) χ ( c m ) ] λ D 3 ( F ) ( c k , c m ) a a a a a a
a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ χ D 3 ( a k ) χ D 3 ( c m ) ] λ D 3 ( a k , c m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a 1 2 k , m = 1 r [ Δ F ( a k ) + χ F ( a k ) + p ] [ Δ F ( a m ) + χ F ( a m ) + p ] [ λ F ( a k , a ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) + q ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ Δ F ( a k ) + χ F ( a k ) + p ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a = 1 2 k , m = 1 r [ Δ F ( a k ) Δ F ( a m ) ] [ λ F ( a k , a m ) ] + 1 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] [ λ F ( a k , a m ) ] a a a a a a a a a a a a a a
a a a a a a a a a a a + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] [ λ F ( a k , a m ) ] + p 2 2 k , m = 1 r [ λ F ( a k , a m ) ] a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + p 2 k , m = 1 r [ Δ F ( a k ) + Δ F ( a m ) ] [ λ F ( a k , a m ) ] + p 2 k , m = 1 r [ χ F ( a k ) + χ F ( a m ) ] [ λ F ( a k , a m ) ] a a a a a a a a a a a a a a
a a a a a a a a a a a a + 1 2 k , m = 1 r [ Δ F ( a k ) Δ F ( a m ) ] + p 2 k , m = 1 r [ Δ F ( a k ) + Δ F ( a m ) ] + 1 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] a a a a a a a a a a a a a a a a
a a a a a a a a a a a a + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] + p 2 k , m = 1 r [ χ F ( a k ) + χ F ( a m ) ] + p 2 2 k , m = 1 r a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + q 2 2 k , m = 1 s [ λ F ( η k , η m ) + 1 ] + q 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) + χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ Δ F ( a k ) + χ F ( a k ) + p ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a = G u t ( F ) + G C ( F ) + p 2 W ( F ) + p D D ( F ) + p C D ( F ) + 2 r 2 s 2 a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] [ λ F ( a k , a m ) ] + 2 p r s a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] + p 2 k , m = 1 r [ χ F ( a k ) + χ F ( a m ) ] + p 2 r 2 2 a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] + q 2 W e ( F ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + q 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) + χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ Δ F ( a k ) + χ F ( a k ) + p ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( a k , η m ) + 1 ]
Corollary 2.
If F is a { C 3 , C 4 } free graph, then
G C ( D 3 ( F ) = G u t ( F ) + G C ( F ) + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] [ λ F ( a k , a m ) ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] + 1 2 k , m = 1 r [ Δ F ( a k ) χ F ( a m ) + χ F ( a k ) Δ F ( a m ) ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 2 r 2 s 2 + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ Δ F ( a k ) + χ F ( a k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Proof. 
By taking p = 0 and q = 0 , we can get the required result. □
Theorem 4.
Let D 4 ( F ) be fourth derived graph of connected and simple graph F and
G C ( D 4 ( F ) ) 4 G C ( F ) + r C D ( F ) + p 2 W ( F ) + q 2 W e ( F ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d m ) + χ F ( e m ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + q 2 k , m = 1 s [ χ F ( d m ) + χ F ( e m ) + χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ 2 χ F ( a k ) + p ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Proof. 
χ D 4 ( F ) ( a k ) = 2 χ F ( a k ) + p and χ D 4 ( F ) ( c k ) = χ ( F ) ( d k ) + χ ( F ) ( e k ) + q = χ D 4 ( F ) ( η k )
Also
λ D 4 ( F ) ( a k , a m ) = λ F ( a k , a m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
λ D 4 ( F ) ( c k , c m ) = λ F ( η k , η m ) + 1 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
λ D 4 ( F ) ( a k , c m ) = λ F ( a k , η m ) + 1 a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
G C ( D 4 ( F ) ) = { a , b } V ( F ) λ D 4 ( a , b ) [ χ D 4 ( a ) χ D 3 ( b ) ] . a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a = 1 2 k , m = 1 r [ χ D 4 ( F ) ( a k ) χ D 4 ( F ) ( a m ) ] λ D 4 ( F ) ( a k , a m ) + 1 2 k , m = 1 s [ χ D 4 ( F ) ( c k ) χ D 4 ( F ) ( c m ) ] λ D 4 ( F ) ( c k , c m ) a a a a a a
a a a a a a a a a a a a a a + 1 2 i = 1 r m = 1 s [ χ D 4 ( F ) ( a k ) + χ D 4 ( F ) ( c m ) ] λ D 4 ( F ) ( a k , c m ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a 1 2 k , m = 1 r [ 2 χ F ( a k ) + p ] [ 2 χ F ( a m ) + p ] [ λ F ( a k , a m ) ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) + q ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ 2 χ F ( a k ) + p ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a = 2 k , m = 1 r [ χ F ( a k ) χ F ( a m ) ] [ λ F ( a k , a m ) ] + p k , m = 1 r [ χ F ( a k ) + χ F ( a m ) ] [ λ F ( a k , a m ) ] + p 2 2 k , m = 1 r [ λ F ( a k , a m ) ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a + q 2 2 k , m = 1 s [ λ F ( η k , η m ) + 1 ] + q 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) + χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ 2 χ F ( a k ) + r ] [ χ F ( d m ) + χ F ( e m ) + s ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a = 4 G C ( F ) + 2 p C D ( F ) + r 2 W ( F ) + p 2 W e ( F ) a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a a + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a a + q 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) + χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ 2 χ F ( a k ) + p ] [ χ F ( d m ) + χ F ( e m ) + q ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Corollary 3.
If F is a { C 3 , C 4 } free graph, then
G C ( D 4 ( F ) ) = 4 G C ( F ) + 1 2 k , m = 1 s [ χ F ( d k ) + χ F ( e k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( η k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
a a a a a a a a a a + 1 2 k = 1 r m = 1 s [ 2 χ F ( a k ) ] [ χ F ( d m ) + χ F ( e m ) ] [ λ F ( a k , η m ) + 1 ] a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a
Proof. 
By taking r = 0 and s = 0 , we can get the required result. □

4. Conclusions

In this paper, we studied the four types of derived graphs subdivision graph, vertex-semitotal graph, edge-semitotal graph, and total graph with the help of the Gutman connection index, where the derived are obtained under the four different operations of subdivision. All the obtained results are expressed in the terms of the different TIs of the parent graph. Moreover, the results are also deduced for the derived graphs being free from the cycles of the order of three and four. However, the problem is still open to computing the Gutman connection index for the derived graphs obtained by the various operations of the product of graphs.

Author Contributions

Conceptualization, F.F.; methodology, D.A.A., F.F. and M.J.; software, F.F. and M.J.; validation, D.A.A. and F.F.; formal analysis, M.J.; investigation, F.F.; resources, D.A.A.; data curation, M.J.; writing—original draft preparation, F.F.; writing—review and editing, M.J.; visualization, D.A.A.; supervision, M.J.; project administration, M.J.; funding acquisition, D.A.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare that there are no conflict of interest regarding the publication of this paper.

References

  1. Yan, F.; Shang, Q.; Xia, S.; Wang, Q.; Ma, P. Application of topological index in predicting ionic liquids densities by the quantitative structure property relationship method. J. Chem. Eng. 2015, 60, 734–739. [Google Scholar] [CrossRef]
  2. Devillers, J.; Balaban, A.T. Topological Indices and Related Descriptors in QSAR and QSPR; Gordon and Breach: Amsterdam, The Netherlands, 1999. [Google Scholar]
  3. Diudea, M.V. QSPR/QSAR Studies by Molecular Descriptors; NOVA: New York, NY, USA, 2001. [Google Scholar]
  4. Todeschini, R.; Consonni, V.; Mannhold, R.; Kubinyi, H.; Timmerman, H. Handbook of Molecular Descriptors; Wiley-VCH: Weinheim, Germany, 2002. [Google Scholar]
  5. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
  6. Gutman, I.; Trinajstic, N. Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
  7. Dobrynin, A.A.; Kochetova, A.A. Degree distance of a graph, a degree analogue of the Wiener index. J. Chem. Inf. Comput. Sci. 1994, 34, 1082–1086. [Google Scholar] [CrossRef]
  8. Gutman, I. Selected properties of the Schultz molecular topological index. J. Chem. Inf. Comput. Sci. 1994, 34, 1087–1089. [Google Scholar] [CrossRef]
  9. Das, K.C.; Gutman, I. On Wiener and multiplicative Wiener indices of graphs. Discret. Appl. Math. 2016, 206, 9–14. [Google Scholar] [CrossRef]
  10. Das, K.C.; Gutman, I.; Nadjafi Arani, M.J. Relations between distance based and degree based topological indices. Appl. Math. Comput. 2015, 270, 142–147. [Google Scholar] [CrossRef]
  11. Gutman, I. Degree-based topological indices. Croat. Chem. Acta 2013, 86, 351–361. [Google Scholar] [CrossRef]
  12. Ali, A.; Trinajstic, N. A Novel/Old Modification of the First Zagreb Index. Mol. Inf. 2018, 37, 1800008. [Google Scholar] [CrossRef]
  13. Javaid, M.; Siddique, M.K.; Ali, U. Novel Connection Based Indices of Several Wheel-Ralated Graph. Comput. J. Comb. Math. 2020, 2, 31–58. [Google Scholar]
  14. Javaid, M.; Siddique, M.K.; Boyah, E. Computing Gutman Connection Index of Thorn Graph. J. Math. 2021, 2021, 2289514. [Google Scholar] [CrossRef]
  15. Yan, W.; Yang, B.; Yeh, Y. The behavior of Wiener indices and polynomials of graphs under five graph decorations. Appl. Math. Lett. 2007, 20, 290–295. [Google Scholar] [CrossRef]
  16. Demirci, M.; Delen, S.; Cevik, A.S.; Cangul, I.N. Omega Index of Line and Total Graphs. J. Math. 2021, 2021, 5552202. [Google Scholar] [CrossRef]
  17. Das, K.C.; Shang, Y. Some extremal graph with respect to sombor index. Mathematics 2021, 9, 1202. [Google Scholar] [CrossRef]
  18. Das, K.C.; Çevik, A.S.; Cangul, I.N.; Shang, Y. On Sombor Index. Symmetry 2021, 13, 140. [Google Scholar] [CrossRef]
  19. Javaid, M.; Ali, U.; Liu, J.B. Computing analysis for first Zagreb connection index and coindex of resultant graphs. Math. Probl. Eng. 2021, 2021, 19. [Google Scholar] [CrossRef]
  20. Liu, J.B.; Javed, S.; Javaid, M.; Shabbir, K. Computing first general zagreb index of operations on graphs. IEEE Access 2017, 7, 47494–47502. [Google Scholar] [CrossRef]
  21. Xu, J.; Liu, J.B.; Bilal, A.; Ahmad, U.; Saddiqui, H.M.A.; Ali, B.; Farhani, M.A. Degree Distance Index of Some Derived Graphs. Mathematics 2019, 7, 283. [Google Scholar] [CrossRef] [Green Version]
  22. Bahadur, A.; Imran, M.; Malik, M.A.; Saddiqui, H.M.A.; Bilal, A.; Farhani, M.R. Gutman Index of some derived graphs. Adv. Appl. Discret. Math. 2019, 20, 165–184. [Google Scholar]
  23. Farid, F.; Javaid, M.; Bonyah, E. Computing Connection Distance Index of derived graphs. Math. Probl. Eng. 2022, 2022, 1439177. [Google Scholar] [CrossRef]
  24. Diestel, R. Graph Theory; Springer: New York, NY, USA, 2000. [Google Scholar]
  25. Flapan, E. When Topology Meets Chemistry; Cambridge University Press and the Mathematical Association of America: Cambridge, UK, 2000. [Google Scholar]
  26. West, D.B. Introduction to Graph Theory; Prentice Hall, Inc.: Upper Saddle River, NJ, USA, 1996. [Google Scholar]
  27. Iranmanesh, A.; Gutman, I.; Khormali, O.; Mahmiani, A. The edge versions of the Wiener index. Match 2009, 61, 663. [Google Scholar]
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

Alrowaili, D.A.; Farid, F.; Javaid, M. Gutman Connection Index of Graphs under Operations. Symmetry 2023, 15, 21. https://doi.org/10.3390/sym15010021

AMA Style

Alrowaili DA, Farid F, Javaid M. Gutman Connection Index of Graphs under Operations. Symmetry. 2023; 15(1):21. https://doi.org/10.3390/sym15010021

Chicago/Turabian Style

Alrowaili, Dalal Awadh, Faiz Farid, and Muhammad Javaid. 2023. "Gutman Connection Index of Graphs under Operations" Symmetry 15, no. 1: 21. https://doi.org/10.3390/sym15010021

APA Style

Alrowaili, D. A., Farid, F., & Javaid, M. (2023). Gutman Connection Index of Graphs under Operations. Symmetry, 15(1), 21. https://doi.org/10.3390/sym15010021

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