10.8
CiteScore
 
5.3
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
Corrigendum
Current Issue
Editorial
Erratum
Full Length Article
Full lenth article
Letter to Editor
Original Article
Research article
Retraction notice
Review
Review Article
SPECIAL ISSUE: ENVIRONMENTAL CHEMISTRY
10.8
CiteScore
5.3
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
Corrigendum
Current Issue
Editorial
Erratum
Full Length Article
Full lenth article
Letter to Editor
Original Article
Research article
Retraction notice
Review
Review Article
SPECIAL ISSUE: ENVIRONMENTAL CHEMISTRY
View/Download PDF

Translate this page into:

Original article
2021
:14;
202103
doi:
10.1016/j.arabjc.2021.102994

Quality testing of spectrum-based distance descriptors for polycyclic aromatic hydrocarbons with applications to carbon nanotubes and nanocones

Faculty of Engineering Sciences, GIK Institute of Engineering Sciences and Technology, Topi, Swabi, KPK 23460, Pakistan
Department of Mathematical Sciences, College of Science, United Arab Emirates University, Al Ain 15551, United Arab Emirates

⁎Corresponding authors. sakander.hayat@giki.edu.pk (Sakander Hayat), m.imran658@uaeu.ac.ae (Muhammad Imran)

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Abstract

In this paper, we investigate the predictive potential of commonly occurring spectrum-based distance descriptors which are based on eigenvalues of distance-related chemical matrices. For our comparative testing, the normal boiling point has been chosen to be representative of van-der-Waals and intermolecular type interactions, whereas, the standard enthalpy/heat of formation is selected to represent thermal properties. We introduce three new chemical matrices and results show that the spectral descriptors based on these new matrices outperform the existing well-studied spectral descriptors. A computational method is used to calculate commonly occurring spectrum-based distance descriptors to investigate their correlation ability with the experimental data for the two chosen physicochemical properties for lower polycyclic aromatic hydrocarbons. By providing the list of the five best spectrum-based distance descriptors, our study contributes towards putting forward the best spectrum-based topological descriptors while mentioning the ones which do not deserve further attention of researchers. Applications of our results to certain families of carbon polyhex nanotubes and one-hexagonal nanocones have been presented. The results can potentially be used to determine certain physicochemical of these nanotubes and nanocones theoretically with higher accuracy and negligible error.

Keywords

Mathematical chemistry
Chemical graph theory
Graphical indices
QSAR/QSPR models
Carbon nanostructures
05C92
05C09
05C90
PubMed
1

1 Introduction

1.1

1.1 Research background

Quantitative structure activity/property relationship (QSAR/QSPR) methods provide efficient correlation of physicochemical characteristics and the bioactivities of chemical compounds. Structure-based topological indices/descriptors assist in generating efficient regression models for these properties with strong prediction power. The pioneer work on graph-theoretic structure-based topological descriptors was started in 1947 by Wiener (1947) who proposed the path number of a graph defined as the distances sum between all ordered pairs of vertices of graphs. The structurally-invariant path number, which later was renamed as the Wiener index, was found to correlate well with the boiling point of alkanes. The Wiener index was the first structurally-invariant topological descriptor.

Generally speaking, the transformation of a molecular graph into a mathematical real number is performed by these topologically-invariant quantities called topological/structure index/descriptor, where a molecular/chemical graph is a hydrogen-depleted molecular structure in which edges correspond to bonds, whereas, vertices correspond to atoms in the underlying chemical compound. The study of these chemical graphs is known as the chemical graph theory. Physicochemical characteristics such as the normal boiling point, the enthalpy of vaporization, the standard heat/enthalpy of formation, the critical pressure, the critical volume, the critical temperature etc. are subsequently correlated by these structurally- and topologically-invariant graph-theoretic descriptors which provide regression models for these characteristics with strong correlation powers. Quantum-theoretic properties such as the total π -electron energy have also been correlated by spectrum-based descriptors. For instance, predictive potential of certain classes of topological descriptors to correlate the π -electronic energy have been studied in Hayat et al. (2020a,c, 2019a).

Well-known classes of topological descriptors include distance-based descriptors (Xu et al., 2014), valency/degree-based descriptors (Gutman, 2013), eigenvalues-based topological descriptors (Consonni and Todeschini, 2008), and counting related topological polynomials and descriptors (Hosoya, 1988). Spectrum-based topological descriptors induce regression models with significantly more efficiency for various physical and chemical properties such as the boiling point and the enthalpy of formation. They are defined based on eigenvalues of certain distance-related or valency-related chemical matrices. Hundreds of molecular descriptors (Gutman and Furtula, 2010; Todeschini and Consonni, 2009) have been proposed so far. The absence of any rigorous criterion to slowdown their number makes the number of proposed molecular descriptors increasing constantly. A considerably big portion of these molecular descriptors are graph-theoretic topological structure descriptors. Consequently, without having any firm criterion to put forward the descriptors which deserve further attention and meanwhile mentioning the ones which show poor performance, there are far too many structure descriptors than there should be.

To put forward the best topological descriptors while mentioning the ones which do not deserve further attention of researchers, Gutman and Tošović (2013) conducted a comparative testing for isomeric octanes. Hayat et al. (2020b) conducted a similar comparative testing for lower benzenoid hydrocarbons for the class of distance-based topological descriptors. Recently, Hayat and Khan (2021) extended the same comparative testing to the class of spectrum-based valency descriptors, which in turn, provides a basic motivation to study the class of spectrum-based distance descriptors. In this paper, we consider the class of graph-theoretic descriptors which are defined based on eigenvalues of distance-related chemical matrices.

Main contributions of this paper are as follows:

  • A computational technique for computing spectrum-based distance descriptors has been proposed. Comparative analyses with related computational techniques show that our method has less computational complexity and is more diverse in computing spectral descriptors.

  • Three new chemical matrices have been proposed and their spectral descriptors show potential in chemical applications.

  • The proposed computational method is used to investigate correlation of spectrum-based topological descriptors with the normal boiling point and standard enthalpy of formation for benzenoid hydrocarbons to test their quality.

  • Some favorable and some unexpected outcomes have been reported based on the quality testing.

  • The newly proposed second ABC Estrada index showcase the best performance among all spectrum-based distance descriptors.

  • Applications to certain infinite families of carbon nanotubes and nanocones have been reported.

  • Our results help in correlating certain physicochemical properties of these nanostructures.

1.2

1.2 literature review

This subsection provides a detailed literature review available on spectrum-based distance descriptors defined in Section 2.

Indulal (2009) and Zhou and Ilić (2010) studied extremal graphs with respect to the distance spectral radius. Indulal et al. (2008), Indulal (2009) and Zhou and Ilić (2010) derived some sharp upper and lower bounds on the distance energy and characterized corresponding extremal graphs. Moreover, Bozkurt et al. (2010) studied distance equi-energetic graphs. Güngör and Bozkurt (2009) introduced and studied the distance Estrada index of graphs. Shang (2020) devised a way to estimate the distance Estrada index of graphs. We also suggest a detailed survey on the distance spectrum of graphs by Aouchiche and Hansen (2014).

The distance Laplacian matrix was introduced by Aouchiche and Hansen (2013) and derived some extremal results on the distance Laplacian spectral radius of graphs. Das et al. (2018) defined the distance Laplacian energy of graphs and derived a relationship between the distance energy and distance Laplacian energy of graphs. Shang (2015) studied the Laplacian Estrada index for evolving graphs.

Aouchiche and Hansen (2016) & Medina et al. (2020) showed some extremal results on the distance signless Laplacian spectral radius and characterized the graphs achieving those bounds. Alhevaz et al. (2018), Medina et al. (2020) and Alhevaz et al. (2021) derived certain extremal results on the distance signless Laplacian energy of graphs. Alhevaz et al. (2021, 2019) derived some sharp upper and lower bounds on the distance signless Laplacian Estrada index of graphs.

Cui and Liu (2012) studied Harary eigenvalues and found some upper and lower bounds on the Harary energy and Estrada index of graphs. Jahanbani (2019) found some new bounds on the Harary energy and Estrada index of graphs. Fath-Tabar et al. (2010) studied the Szeged eigenvalues and related spectral descriptors of graphs. Najdafi-Arani (2011) showed some sharp bounds on the PI energy of graphs. Corresponding extremal graphs were also characterized in Najdafi-Arani (2011).

Kanna et al. (2019) showed some sharp upper and lower bounds on the degree-distance energy of graphs. The Schultz matrix (Schultz, 1989) was shown to possess potential applications in predicting the normal boiling points of alkanes. Roshan and Sarasija (2019) defined the Gutman covering matrix of graphs. They derived some sharp upper and lower bounds on the Gutman covering energy of graphs.

2

2 Spectrum-based distance descriptors

Mathematically, a graph Γ is nothing but an order pair Γ = ( V , E ) comprising a set V = V ( Γ ) of points called vertices and connection E ( Γ ) V 2 between those pairs of points called edges. A chemical/molecular graph is a hydrogen-depleted chemical structure obtained from a chemical compound. Vertices (resp. edges) in a chemical graph correspond to atoms (resp. bonds) in the underlying chemical compound. Two vertices are called adjacent if there is an edge between. The number of adjacent vertices to a given vertices x V ( Γ ) is called the degree or valency of x and is denoted by d x . A vertex degree in a chemical graph, corresponding to an organic chemical compound, can be at most four, since the valency of the carbon atom is four. For more notations and terminologies on chemical graph theory, we refer the reader to Diudea et al. (2001) and Gutman and Polansky (1986).

Topological descriptors are mathematical functions mapping simple connected graphs to real numbers having significant applications in chemistry (Balaban et al., 1983). Valency/degree-based topological descriptors possess defining structures based on valencies of vertices, whereas, the defining structures of distance-based topological descriptors are based on distances between vertices in graphs. The atom-bond connectivity index, the Randić connectivity index, the sum-connectivity index and Zagreb indices, among others, are examples of valency-based descriptors. The Wiener index, the Balaban index, the Szeged index, among others, are included in the examples of distance-based descriptors. Spectrum-based topological descriptors comprise the defining structure based on eigenvalues of distance-related or valency-related chemical matrices. The adjacency energy, the Estrada index, the distance energy and Estrada index and Laplacian & signless Laplacian energies and Estrada indices, among many others, are included in the list of spectrum-based topological descriptors. Hosamani et al. (2017) reviewed various results on energies of different graph-related matrices. For a book on adjacency energy, we refer to Li et al. (2012). Moreover, for a book on the spectral radius of different graphical matrices, we refer to Stevanović (2014). Certain computational results on degree and distance-based topological descriptors are presented in Hayat (2017), Hayat and Imran (2014), Hayat et al. (2019b), and Hayat et al. (2020b).

Next we define some well-known distance-related chemical matrices. Later, spectrum-based distance descriptors are defined based on the eigenvalues of these matrices.

2.1

2.1 Existing distance-based chemical matrices

We start with the well-known classical distance matrix of graphs.

2.1.1

2.1.1 The distance matrix

Although, concept of the distance matrix goes back to Cayley (1841) who used it in a geometric setting. Its graph-theoretic spectral study begin formally in 20th century, see for instance (Young and Householder, 1938). In 1971, Graham and Pollack (1971) established a relationship between the number of negative eigenvalues of the distance matrix and the addressing problem in data communication systems.

The distance matrix D = D Γ of an n-vertex graph Γ is an n × n symmetric matrix defined as ( D Γ ) u , v = d Γ ( u , v ) , u v ; 0 , u = v , where d Γ ( u , v ) is the distance between vertices u and v in Γ .

2.1.2

2.1.2 The distance Laplacians

Let Γ be an n-vertex graph. The transmission of a vertex u V ( Γ ) is defined to be the sum of distances between all vertices of Γ and the fixed vertex u. Tr ( u ) v V ( Γ ) d Γ ( u , v ) . The average transmission t ( Γ ) of a graph Γ is defined as follows: t ( Γ ) 1 n v V ( Γ ) Tr ( v ) . The total transmission of a graph Γ is defined to be the sum of distances between all unordered pairs of vertices in Γ . Clearly, σ ( Γ ) 1 2 v V ( Γ ) Tr ( v ) . The transmission vector of Γ is an n × 1 vector denoted by Tr and defined as Tr u Tr ( u ) for all u V ( Γ ) . Let Diag ( Tr ) be the diagonal matrix corresponding the vector Tr such that Diag ( Tr ) uu Tr ( u ) . The distance Laplacian matrix DL = DL Γ is an n × n symmetric matrix defined as DL = Diag ( Tr ) - D Γ . Similarly, the distance signless Laplacian matrix DG = DG Γ of an n-vertex graph Γ is an n × n symmetric matrix defined as DQ = Diag ( Tr ) + D Γ , where D Γ is the distance matrix of Γ .

2.1.3

2.1.3 The Harary matrix

The Harary matrix has recently been introduced by Güngör and Çevik (2010). For an n-vertex graph Γ , the Harary matrix H = H Γ is an n × n symmetric matrix defined as ( H Γ ) u , v = 1 d Γ ( u , v ) , u v ; 0 , u = v .

2.1.4

2.1.4 The Szeged matrix

Before defining the Szeged matrix of a graph, we need some necessary definitions. Corresponding to an edge e = uv E ( Γ ) of a graph Γ , we define the following parameters: n u , e | { w V ( Γ ) | d Γ ( w , u ) < d Γ ( w , v ) } | , n v , e | { w V ( Γ ) | d Γ ( w , u ) > d Γ ( w , v ) } | , n 0 , e | { w V ( Γ ) | d Γ ( w , u ) = d Γ ( w , v ) } | .

Based on the quantities n u , e and n v , e , Diudea et al. (1997) introduced the Szeged matrix of graphs. For an n-vertex graph Γ , the Szeged matrix Sz = Sz Γ is an n × n symmetric matrix defined as ( Sz Γ ) u , v = n u , e n v , e , uv E ( G ) ; 0 , Otherwise .

2.1.5

2.1.5 The Padmakar-Ivan (PI) matrix

The Padmakar-Ivan (PI) matrix and related spectrum-based descriptors were introduced by Najdafi-Arani (2011). The PI matrix PI = PI Γ of an n-vertex graph Γ is an n × n symmetric matrix defined as ( PI Γ ) u , v = n u , e + n v , e , uv E ( G ) ; 0 , Otherwise .

2.1.6

2.1.6 The degree-distance matrix

The degree-distance matrix was introduced by Dobrynin and Kochetova (1994) in term of the degree-distance index of graphs. The degree-distance matrix DD = DD Γ of an n-vertex graph Γ is an n × n symmetric matrix defined as ( DD Γ ) u , v = d u + d v d Γ ( u , v ) , u v ; 0 , u = v .

2.1.7

2.1.7 The Schultz matrix

Let A Γ be the adjacency matrix of Γ and D Γ be the distance matrix of Γ . Introduced by Schultz (1989) in 1989, the Schultz matrix is defined as follows: S Γ = A Γ + D Γ .

2.2

2.2 Some new chemical matrices

In this subsection, we define some new chemical matrices and investigate chemical applicability of corresponding spectrum-based distance descriptors in QSAR studies. Note that these matrices correspond to some well-established distance-based topological descriptors of graphs.

2.2.1

2.2.1 The second atom-bond connectivity ( ABC 2 ) matrix

The general atom-bond connectivity index ABC k , ( k Z + ) of a graph Γ is defined as follows: ABC k ( Γ ) = uv E ( Γ ) q u + q v - 2 q u q v . For k = 1 , we have ( q u , q v )=( d u , d v ), where d u is the degree/valency of u in Γ . The first ABC index was proposed by Estrada et al. (1998). Graovac and Ghorbani (2010) considered ( q u , q v )=( n u , e , n v , e ) and named it the second version of the ABC index.

Since most of the chemical matrices are actually based on some corresponding topological descriptors, we introduce a chemical matrix based on the second atom-bond connectivity index. Therefore, the second atom-bond connectivity matrix ABC 2 = ABC Γ 2 of an n-vertex graph Γ is an n × n symmetric matrix defined as ( ABC Γ 2 ) u , v = n u , e + n v , e - 2 n u , e n v , e , uv E ( G ) ; 0 , Otherwise .

2.2.2

2.2.2 The second geometric-arithmetic ( GA 2 ) matrix

The general geometric-arithmetic (GA) index GA k , ( k Z + ) of a graph Γ is defined as follows: GA k ( Γ ) = uv E ( Γ ) 2 q u q v q u + q v . If ( q u , q v )=( d u , d v ), then k = 1 . The GA 1 index was proposed by Vukičević and Furtula (2009). Fath-Tabar et al. (2010) by considering ( q u , q v )=( n u , n v ), introduced the second version of the GA index.

Based on the second geometric-arithmetic index of an n-vertex graph Γ , the second geometric-arithmetic matrix GA 2 = GA Γ 2 is an n × n symmetric matrix defined as ( GA Γ 2 ) u , v = 2 n u , e n v , e n u , e + n v , e , uv E ( G ) ; 0 , Otherwise .

2.2.3

2.2.3 The Gutman matrix

The Gutman index was introduced by Gutman (1994) in 1994 as a multiplicative version of the so-called degree-distance index. It is defined as Gut ( Γ ) = u , v V ( Γ ) , u v d u d v d Γ ( u , v ) .

Based on the defining structure of the Gutman index, we define the Gutman matrix Gut = Gut Γ of an n-vertex graph Γ to be an n × n symmetric matrix defined as follows: ( Gut Γ ) u , v = d u d v d Γ ( u , v ) , u v ; 0 , u = v .

2.3

2.3 Spectrum-based distance descriptors

A spectrum-based descriptor defined based on the eigenvalues of a distance-related chemical matrix is said to be a spectrum-based distance descriptor.

For an n-vertex graph Γ , let M { D , H , Sz , PI , DD , S , ABC 2 , GA 2 } be a chemical matrix of Γ defined in the previous subsection. Let λ 1 M λ 2 M λ n M be the eigenvalues of M. In this paper, we consider the following spectral descriptors corresponding to a chemical matrix M.

The M spectral radius is simply defined to be the largest eigenvalues of M: ρ M = ρ M ( Γ ) λ 1 M The energy of M, sometimes called M-energy, is defined as follows: E M = E M ( Γ ) i = 1 n | λ i M | The Estrada index of M, also called M-Estrada index, is defined as follows: EE M = EE M ( Γ ) i = 1 n e λ i M

For distance Laplacians, the spectral descriptors are defined differently. If N { DL , DQ } and λ 1 N λ 2 N λ n N be its eigenvalues. Then spectral radius is defined similarly as for the matrix M. ρ N = ρ N ( Γ ) λ 1 N The distance Laplacian or signless Laplacian energy is defined as follows: E N = E N ( Γ ) i = 1 n | λ i N - t ( Γ ) | The distance Laplacian or signless Laplacian Estrada index is defined as follows: EE N = EE N ( Γ ) i = 1 n e ( λ i N - σ ( Γ ) ) The average transmission t ( G ) and the total transmission σ ( Γ ) of a graph Γ are defined in SubsubSection 2.1.2.

3

3 A unified computational method

In this section, we present a unified computational technique to compute all the spectrum-based topological descriptors in Section 2. The proposed technique is the main tool in computing these eigenvalues related topological descriptors for polycyclic aromatic compounds, carbon nanotubes and carbon nanocones in Sections 4, 5 & 6 respectively.

Among the other classes of topological descriptors such as valency-based descriptors, distance-based descriptors, counting related molecular descriptors, the class of eigenvalues-based topological descriptors is highly non-trivial and somewhat complicated since they are defined based on eigenvalues of graphical matrices. The branch of graph theory which derives certain structural properties of graphs from the eigenvalues of their related graph-theoretic matrices is called the spectral graph theory. Spectral graph theory assists in computing the eigenvalues of graphs on small order, say up to six vertices. There are also characterization results in spectral graph theory such as graphs with smallest eigenvalue at least - 2 studied in Desai and Rao (1994). For more details on spectral graph theory, we refer the reader to the book by Cvetković et al. (1995) and by Brouwer and Haemers (2012). Although there is a rich literature available on graph spectra but current tools do not assist in computing all the eigenvalues of higher-order graphs. Thus, it is essential to develop computational methods based on computer softwares to compute the complete spectrum of eigenvalues of a given matrix which corresponds to a graph with many vertices.

Before we go into the details of our proposed method, we review all known methods available in the literature. Ashrafi (2010, 2009) proposed a computer-based computational technique to calculate the adjacency energy and adjacency Estrada index of a chemical graph i.e. graph based on organic chemical structures and therefore have maximum valency up to 4. Their computational method makes use of certain computer software packages such as HyperChem (2002) to draw a chemical graph, Diudea et al. (2002) to calculate its adjacency matrix and finally GAP (The GAP Team, 1992) to calculate the adjacency energy and adjacency Estrada index. Hayat (2017) proposed a computational technique for various distance-based topological descriptors just by using newGraph (Stevanović et al.) and MatLab (MATLAB). Furthermore, a comparative analysis in Hayat (2017) with Ashrafi (2010) and Ashrafi and Sadati (2009) was also conducted to show that the former possesses less computational complexity and is more diverse in computing distance-based topological descriptors. Hayat et al. (2019b) extended the method in Hayat (2017) to the class of degree-distance-based and degree-based descriptors. Hayat et al. (2019a) presented a similar technique to compute the adjacency energy, the adjacency Estrada index and the inertia indices. In this paper, we extend the technique of Hayat et al. (2019a) to the 33 spectrum-based topological descriptors in Section 2.”In what follows, the method by Ashrafi (2010, 2009) is explained, for a chemical graph H, in a three-step algorithm:

Step 1: Draw H on HyperChem to obtain.hin file corresponding to H.

Step 2: Input the.hin file to Topocluj and calculate its adjacency matrix A. Topocluj will output the respective.m file.

Step 3: Insert the.m file in a GAP program developed by Ashrafi (2010) and Ashrafi and Sadati (2009) to calculate the A-energy and A-Estrada index of H.”.

Fig. 1 presents a flowchart of the method by Ashrafi et al.

Flowchart of the technique by Ashrafi et al.
Fig. 1
Flowchart of the technique by Ashrafi et al.

Although this method by Ashrafi et al. provides a platform to perform computational eigenvalue analysis for chemical graphs, it has certain disadvantages. For instance, it is restricted to chemical graphs which makes it not applicable for inorganic structures. Moreover, it is restricted to calculate the A-energy and A-Estrada index. We fill these gaps by proposing a unified computational method which can compute any spectrum-based descriptor from Section 2 while possesses less computational & algorithmic complexities. Rather than using HyperChem and Topolocluj for drawing a chemical graph and calculate its adjacency matrix, we use a single and more efficient platform i.e. newGraph (Stevanović et al.) which ”is a fully integrated environment used for improving a research process in graph theory. It is compatible both with conveniently drawing a general graph and then computing various graph-theoretic parameters including the adjacency and distance matrices. For a general graph G, our two-step computational method is explained as follows:”.

Step 1: ”Use newGraph as single platform to both draw G and calculate its distance matrix A.

Step 2: Insert the matrix A into our MatLab (MATLAB) program and compute any of the spectrum-based descriptor from Section 2.”.

Fig. 2 depicts a flowchart of our proposed method.

Flowchart of our proposed method.
Fig. 2
Flowchart of our proposed method.

We have created a public open repository on GitHub where we have uploaded an early view of ReadMe file, our MatLab code and a PDF file to explain the work- ing pattern of our technique with a minimal working example (MWE). The GutHub page is accessible via https://github.com/Sakander/Distance-based-spectral-descriptors.git.

A comparative analysis has been conducted to measure the efficiency of our method with the method by Ashrafi et al. We fix two benzenoid hydrocarbons i.e. coronene and ovalene (see Fig. 3) for our comparative analysis. Computational complexity has been investigated for these two graphs and the data is provided in Table 1.

The graphs of coronene and ovalene.
Fig. 3
The graphs of coronene and ovalene.

We also conduct comparative analysis between newGraph and Topolocluj & HyperChem in our method and Ashrafi and coauthors, respectively. Table 2 gives a detailed comparison between these two software packages and exhibits their pros and cons. Collectively Tables 1 & 2 provide a detailed comparative analysis between our method and the technique by Ashrafi et al. These tables shows that our proposed computational method is less computationally & algorithmically complex and more diverse in calculating spectrum-based topological descriptors.

Table 1 Comparison between Matlab and GAP for analyses of input, output and computational time in our method and Ashrafi and coauthors.
Matlab GAP
Input Adjacency matrix Adjacency matrix
Output 33 spectrum-based indices from Section 2 Energy and Estrada index
Computational time for coronene 0.021 s 1.325 s
Computational time for ovalene 0.023 s 1.624 s
Table 2 A comparative analysis between newGraph and Topolocluj & HyperChem in our method and Ashrafi and coauthors, respectively.
newGraph HyperChem
Valency/degree restriction No restriction At most 4
Efficiency in drawing Significantly efficient Good efficiency for chemical graphs
Matrix formatting No formatting is required Topocluj: Extensive matrix formatting
Availability to user Freely available Requires a user license
Space on disk Pre-installation of Java with size 55 MB 264 MB
Invariants newGraph: 91 graph invariants Topocluj: 12 graph invariants

4

4 Predictive potential of spectrum-based distance descriptors

To investigate the correlation power and to determine the efficiency in quantitative structure activity/property relationship studies of spectrum-based topological descriptors, this section conducts a comparative testing to do the needful.

Standard enthalpy/heat of formation and normal boiling point are the standard chemical & physical properties which are opted for any comparative testing of topological descriptors. Chemically speaking, the normal boiling point is selected to advocate the van-der-Waals and intermolecular type interactions, whereas, the heat of formation is selected to be the representative of thermal characteristics. These two physicochemical characteristics are then correlated with a chosen set of topological descriptors. Better the correlation, better the prediction potential of a descriptors, is the simple criterion to access the performance of a topological descriptor.

Although it is customary to choose isomeric alkanes to be considered as molecules for this sort of comparative testings, we have selected lower polycyclic aromatic hydrocarbons (PAHs). The reason is that isomeric alkanes are thought to represent acyclic molecular structures, however, PAHs are considered to represent both cyclic and acyclic chemical structures. Graph-theoretic reasoning behind this fact is that trees are considered subgraphs of general graphs having cycles. Another reason of choosing PAHs is that some spectrum-based topological descriptors are defined to generalize the previously defined descriptors from acyclic structures to cyclic. Note further that for a comparative testing the number of molecules must be sufficiently large enough to acquire reliable and authentic statistical inferences. Moreover, the experimental data should be publicly available conveniently. Our choice of 22 lower polycyclic aromatic hydrocarbons meet both of these standard requirements. Fig. 4 exhibit the 22 PAHs with their aromaticity considered in this paper.”For experimental data regarding the normal boiling points of 22 lower polycyclic aromatic hydrocarbons (PAHs), we consulted the standard NIST databases (NIST Standard Reference Database) to acquire it. Moreover, the seminal work by Allison and Burgess (2015) provides the experimental data for the heat/enthalpy of formation for these polycyclic aromatic hydrocarbons. The acquired experimental data has been confirmed by tallying with a similar data available in the paper by Nikolić et al. (1998). We also refer the reader to a work by Putz et al. (2013, 2015) for an interesting interaction between topological descriptors, QSAR studies and PAHs.”

The 22 polycyclic aromatic compounds (PAHs) considered for our comparative testing.
Fig. 4
The 22 polycyclic aromatic compounds (PAHs) considered for our comparative testing.

We use our proposed computational technique from Section 3 to calculate all the distance-based spectral descriptors from Section 2 for the 22 lower polycyclic aromatic hydrocarbons given in Fig. 4. Afterwards, the correlation is established between a topological descriptor and the experimental data for the normal boiling point and enthalpy of formation for the 22 PAHs. Although it is always preferably tried to establish a curvilinear correlation, we could not develop a curvilinear correlation for any of the spectrum-based distance descriptor. Thus, we measure the prediction power of a topological descriptor by evaluating its correlation coefficients with the physicochemical properties.”The data for such correlation coefficients with the normal boiling point as well as with the standard enthalpy/heat of formation for lower benzenoid hydrocarbons is provided in Table 3, in which Δ H f o (resp. b.p.) denotes the standard heat of formation (resp. the normal boiling point) of a molecular structure.”.”It is important to notice in Table 3 that, for a given spectrum-based distance descriptor, the two correlation coefficients with the standard enthalpy of formation and the normal boiling point are considerably close to each other. This ensures us the significant appropriateness of our chosen physicochemical properties, very distinctive in nature though. This also suggests that these two physicochemical characteristics could be chosen to investigate the efficiency of any topological or molecular descriptor, in general.”

Table 3 Correlation coefficients ρ ( b . p . ) and ρ ( Δ H f o ) between spectrum-based distance descriptors with the normal boiling point b . p . and the standard enthalpy of formation Δ H f o respectively for the 22 lower PAHs.
Topological index ρ ( b . p . ) ρ ( Δ H f o )
ρ D 0.9619 0.9640
E D 0.9619 0.9640
EE D 0.3339 0.3562
ρ DL 0.9192 0.9489
E DL 0.9221 0.9432
ρ D Q 0.9583 0.9637
E D Q 0.9125 0.9366
ρ S 0.9623 0.9640
E S 0.9648 0.9624
EE S 0.3339 0.3561
ρ H 0.9919 0.9250
E H 0.9964 0.9543
EE H 0.8115 0.6991
ρ DD 0.9846 0.9055
E DD 0.9950 0.9407
EE DD 0.2634 0.0727
ρ Gut 0.9755 0.8864
E Gut 0.9905 0.9247
EE Gut 0.2260 0.0330
ρ Sz 0.9077 0.8766
E Sz 0.9008 0.8474
ρ PI 0.9720 0.9294
E PI 0.9572 0.9081
EE PI 0.2351 0.3131
ρ ABC 2 - 0.6186 - 0.5584
E ABC 2 0.9776 0.9525
EE ABC 2 0.9958 0.9635
ρ GA 2 0.9154 0.8411
E GA 2 0.9951 0.9463
EE GA 2 0.9946 0.9435

4.1

4.1 Analysis of results

We have measured the efficiency of a topological descriptor in Table 3 by investigating the average of the two correlation coefficients. The simple criterion is that closer the average correlation coefficient to one, better the performance of topological descriptor is. Based on the average correlation coefficient, we have composed a list of top five best performing spectral descriptors. Table 4 gives the priority list for the five best spectrum-based distance descriptors. Table 5 provides a detailed statistical analysis for the prioritized five spectrum-based descriptors.

Table 4 The five best spectrum-based distance topological descriptors.
Topological descriptor Position on the priority list
EE ABC 2 1
E H 2
E GA 2 3
EE GA 2 4
E DD 5
Table 5 The regression model, determination coefficient, correlation coefficient and standard error of fit for the five best well-performing spectrum-based distance descriptors with 22 lower benzenoid hydrocarbons.
S.No Index Regression model Statistics
1 EE ABC 2 BP = - 127.05 ± 25.88598 + 24.719 ± 1.06243 EE ABC 2 r 2 = 0.9916 , ρ = 0.9958 , s = 0.4885
EE ABC 2 Δ H f o = - 49.606 ± 44.58162 + 14.125 ± 1.82975 EE ABC 2 r 2 = 0.9284 , ρ = 0.9635 , s = 1.4248
2 H E BP = - 37.54 ± 20.40207 + 19.614 ± 0.77688 H E r 2 = 0.9928 , ρ = 0.9964 , s = 0.5681
H E Δ H f o = 4.4564 ± 42.55145 + 11.093 ± 1.62030 H E r 2 = 0.9107 , ρ = 0.9543 , s = 2.0066
3 E GA 2 BP = - 50.033 ± 24.39614 + 20.061 ± 0.92836 E GA 2 r 2 = 0.9951 , ρ = 0.9918 , s = 0.6473
E GA 2 Δ H f o = - 0.5631 ± 47.16455 + 11.266 ± 1.79477 E GA 2 r 2 = 0.8955 , ρ = 0.9463 , s = 2.1192
4 EE GA 2 BP = - 33.94 ± 24.79515 + 10.541 ± 0.51096 EE GA 2 r 2 = 0.9893 , ρ = 0.9946 , s = 1.2890
EE GA 2 Δ H f o = 9.169 ± 46.93558 + 5.9051 ± 0.96722 EE GA 2 r 2 = 0.8902 , ρ = 0.9435 , s = 4.1320
5 E DD BP = 4.0165 ± 22.22913 + 3.7084 ± 0.17360 E DD r 2 = 0.9900 , ρ = 0.9950 , s = 3.5415
E DD Δ H f o = 31.288 ± 44.59168 + 2.0704 ± 0.34825 E DD r 2 = 0.8849 , ρ = 0.9407 , s = 12.0303

Results support our newly defined spectrum-based distance descriptors as the second atom-bond connectivity Estrada index gives the best performance of them all. Moreover, two more newly introduced spectral descriptors based on the second geometric-arithmetic matrix make it to the top-five priority list. Those are the second geometric-arithmetic energy and Estrada index of graphs. Among the spectral descriptors available in the literature, the Harary energy and the degree-distance energy also make it to the”priority list of the five best spectrum-based distance descriptors. The results warrant further usage of the second atom-bond connectivity energy and Harary energy in the structure–activity and structure–property models.”.

The data in Table 3 suggests a number of favorable and unfavorable conclusions. By favorable outcome, we mean some less-known spectrum-based distance descriptors such as the Harary energy and the degree-distance energy etc. performed extraordinarily, even though they are less-reputable among the researchers. On the other hand, some well-established and well-reputable spectrum-based distance descriptors such as the distance energy and Estrada index and the distance Laplacian & signless Laplacian energies and Estrada indices, could not perform up to their reputation among chemical graph theorists and theoretical chemists.

Practically speaking, topological descriptors having correlation coefficients less then 0.95 are not recommended for their usage in quantitative structure–activity and structure–property models. Having said that, the well-known spectrum-based descriptors such as the the distance energy and the distance Estrada index, the Laplacian & signless Laplacian energies and Estrada indices, the Szeged and Schultz energies and Estrada indices etc. have correlation coefficients lower than 0.95 which is considered very poor from application perspectives. They should not be suggested for the quantitative structure–activity and structure–property models.”For their use in structure–property relationship models, we prefer the newly defined second atom-bond connectivity Estrada index and the Harary energy which have both of the correlation coefficients grater than 0.95. Despite their popularity, the results warrant further usage of the second atom-bond connectivity Estrada index and the Harary energy in the quantitative structure–activity and structure–property models.””Next, we exhibit the scatter plots of best five spectrum-based distance descriptors with normal boiling point and enthalpy of formation for the selected 22 lower benzenoid hydrocarbons. Tables 6 and 7 depict these scatter plots and the corresponding linear regression models. This explains the data dispersion and the error between the exact and correlated data points.””In conclusion, for their use in structure–property relationship models, we prefer only the second atom-bond connectivity energy and the Harary energy which have both of the correlation coefficients grater than 0.95. Despite of their popularity, the results warrant further usage of the second atom-bond connectivity index in the structure–activity and structure–property models.”

Table 6 Scatter plots between top five spectrum-based distance descriptors and the normal boiling point of 22 lower PAHs.
Table 7 Scatter plots between top five spectrum-based distance descriptors and the enthalpy of formation of 22 lower PAHs.

5

5 Applications to carbon polyhex nanotubes

When the size of molecular structures reduces to the range 1–100 nm, the study of nanotechnology starts. Having potential applications in computer science, electronics and medicine, nanotechnology creates many new devices and materials. Carbon nanotubes (CNTs) are cylindrical nano-skeletons comprising allotropic carbon. Carbon nanotubes have been found to possess relatively more applicative potential than their other counterparts.

The family of carbon polyhex nanotubes are the ones whose cylindrical surface is encompasses by hexagonal tessellation. Carbon polyhex nanotubes possess extraordinary stability for their existence in nature and, therefore, CNTs have fascinating thermal, electrical and mechanical characteristics (Dresselhaus et al., 1996). These significantly distinctive features of carbon polyhex nanotubes make these nanotubes the most studied nanostructures so far. Based on chirality, carbon polyhex nanotubes consist of different shapes such as zigzag, armchair and chiral etc. Fig. 5 depicts the zigzag and armchair structures of carbon polyhex nanotubes.

3D view of zigzag and armchair polyhex nanotubes.
Fig. 5
3D view of zigzag and armchair polyhex nanotubes.

In order to study spectrum-based topological descriptors, we construct 2D graphs of these zigzag and armchair carbon polyhex nanotubes. Denoted by TUZC 6 [ m , n ] , the zigzag polyhex nanotube is parameterized having m (resp. n) to be the number of hexagons in a row (resp. column). Similarly, the armchair polyhex nanotube is denoted by TUAC 6 [ m , n ] , where the parameter m (resp. n) is defined to be the number hexagons in a fixed row (resp. column). Just for notational convenience, we denote an ( m , n )-dimensional zigzag (resp. armchair) nanotube by ZC 6 [ m , n ] (resp. AC 6 [ m , n ] ). Fig. 6 exhibits the ( m , n )-dimensional zigzag and armchair polyhex nanotubes.

An ( m , n )-dimensional zigzag and armchair polyhex nanotubes.
Fig. 6
An ( m , n )-dimensional zigzag and armchair polyhex nanotubes.

In this section, we employ our computational technique from Section 3 to calculate five best spectrum-based distance descriptors in Table 4 for carbon polyhex nanotubes. We choose two infinite families of zigzag polyhex nanotubes i.e. ZC 6 [ m , n ] with m = 4 and m = 5 . The remaining cases could be dealt similarly. Table 8 shows the calculations obtained for the zigzag polyhex nanotube ZC 6 [ 4 , n ] for 2 n 10 , as ZC 6 [ 4 , 1 ] is trivial.

Table 8 The five best spectrum-based topological descriptors for ZC 6 [ 4 , n ] with 2 n 10 .
ZC 6 [ 4 , n ] EE ABC 2 EE GA 2 E GA 2 E DD E H
ZC 6 [ 4 , 2 ] 43.8381 88.7005 47.4519 257.867 49.5709
ZC 6 [ 4 , 3 ] 63.559 133.8048 71.2886 401.5943 75.1084
ZC 6 [ 4 , 4 ] 82.6064 183.1969 96.6383 545.7397 100.7379
ZC 6 [ 4 , 5 ] 101.5198 233.275 122.1839 689.7301 126.3356
ZC 6 [ 4 , 6 ] 120.2328 285.5317 148.5081 834.0704 152.0197
ZC 6 [ 4 , 7 ] 138.8429 338.4085 174.9923 978.1854 177.6372
ZC 6 [ 4 , 8 ] 157.4242 390.6616 201.2161 1122.248 203.2384
ZC 6 [ 4 , 9 ] 175.9131 443.3483 227.7947 1266.368 228.8763
ZC 6 [ 4 , 10 ] 194.3108 497.784 254.7359 1410.176 254.4346

Next we use the cftool of MatLab on data in Table 8. cftool is a tool for curves and surface fitting in MatLab. We use R2013a version of the MatLab in our approximations. Our MatLab program generated the following results with 95% confidence intervals of coefficients: EE ABC 2 ( ZC 6 [ 4 , n ] ) = 18.77 ± 0.15 n + 7.214 ± 1.003 , E H ( ZC 6 [ 4 , n ] ) = 25.62 ± 0.01 n - 1.711 ± 0.07 , E GA 2 ( ZC 6 [ 4 , n ] ) = 26.01 ± 0.35 n - 6.639 ± 2.287 , EE GA 2 ( ZC 6 [ 4 , n ] ) ) = 51.42 ± 1.03 n - 20.2 ± 6.73 , E DD ( ZC 6 [ 4 , n ] ) = 144.1 - 0.1 n - 30.51 ± 0.31 . These results will help in correlating the π -electronic energies of ZC 6 [ 4 , n ] with significantly higher accuracy.

We also use our computational method in Section 3 to compute the best five spectrum-based topological descriptors exhibited in Table 4 for ZC 6 [ 5 , n ] nanotube. Table 9 shows the calculations obtained for the zigzag polyhex nanotube ZC 6 [ 5 , n ] for 2 n 10 , as ZC 6 [ 5 , 1 ] is trivial.

Table 9 The five best spectrum-based topological descriptors for ZC 6 [ 5 , n ] with 2 n 10 .
ZC 6 [ 5 , n ] EE ABC 2 EE GA 2 E GA 2 E DD E H
ZC 6 [ 5 , 2 ] 51.3551 110.9939 58.7608 321.2256 60.9452
ZC 6 [ 5 , 3 ] 74.8782 167.4179 88.1407 500.9904 92.5372
ZC 6 [ 5 , 4 ] 98.0492 224.7084 118.087 680.0174 123.9716
ZC 6 [ 5 , 5 ] 120.8667 285.951 149.2641 859.7601 155.5456
ZC 6 [ 5 , 6 ] 143.5718 349.1024 181.1978 1039.418 187.1002
ZC 6 [ 5 , 7 ] 166.1828 412.4662 213.212 1218.892 218.6333
ZC 6 [ 5 , 8 ] 188.6876 477.1917 245.5984 1398.273 250.135
ZC 6 [ 5 , 9 ] 211.1483 542.4422 278.1935 1577.927 281.6863
ZC 6 [ 5 , 10 ] 233.5527 608.1185 310.9007 1757.272 313.1939

Next we use the cftool on data in Table 9 for curve fitting purpose. Our MatLab program generated the following results with 95% confidence intervals of coefficients: EE ABC 2 ( ZC 6 [ 5 , n ] ) = 22.74 ± 0.15 n + 6.724 ± 0.976 , E H ( ZC 6 [ 5 , n ] ) = 31.53 ± 0.01 n - 2.103 ± 0.059 , E GA 2 ( ZC 6 [ 5 , n ] ) = 31.63 ± 0.5 n - 7.174 ± 3.25 , EE GA 2 ( ZC 6 [ 5 , n ] ) ) = 62.42 ± 1.43 n - 21.35 ± 9.34 , E DD ( ZC 6 [ 5 , n ] ) = 179.5 + 0.1 n - 37.76 ± 0.3 .

These results will help in correlation the π -electronic energies of ZC 6 [ 5 , n ] with significantly higher accuracy.

6

6 Applications to one-hexagonal carbon nanocones

Carbon nanostructures are among those organic structures which possess a fascinating phenomenon of the occurrence of hollow carbon structures. Other than nanotubes and fullerenes, carbon nanocones are observed as nano-caps at the ends of a nanotube. They could also be observed as a free-standing structure on a flatten-up graphite surface. Extraction of a fan from a graphite sheet, rolling the remaining sector about its apex and then joining the two open sides would normally generate a carbon nanocone structure. Especially, when the angle of apex becomes more than 60∘, a hexagon appears at the top of the apex of the nanocones. One-hexagonal nanocone is a carbon nanocone, which has a hexagon on the tip of its apex, called its core. Fig. 7 depicts two different 3D views of a one-hexagonal nanocone.

3D views of a one-hexagonal nanocone.
Fig. 7
3D views of a one-hexagonal nanocone.

We denote an n-dimensional one-hexagonal nanocone by CNC 6 [ n ] , where n is the number of hexagonal layers covering up the conical surface of the nanocone. Moreover, six in the subscript shows that the core of the nanocone is a hexagon. Fig. 8 depicts the 3-dimensional CNC 6 [ 3 ] nanocone.

The 3-dimensional CNC 6 [ 3 ] nanocone.
Fig. 8
The 3-dimensional CNC 6 [ 3 ] nanocone.

We also use our computational method in Section 3 to compute the best five spectrum-based topological descriptors exhibited in Table 4 for one-hexagonal nanocone CNC 6 [ n ] . Table 10 shows the calculations obtained for the one-hexagonal nanocone CNC 6 [ n ] for 1 n 10 .

Table 10 The five best spectrum-based topological descriptors for CNC 6 [ n ] with 1 n 10 .
CNC 6 [ n ] EE ABC 2 EE GA 2 E GA 2 E DD E H
CNC 6 [ 1 ] 8.9796 13.6967 8.0000 29.3333 7.3333
CNC 6 [ 2 ] 28.7419 61.9253 33.0350 166.0818 32.6030
CNC 6 [ 3 ] 58.4033 151.0953 77.5585 410.3461 75.8024
CNC 6 [ 4 ] 100.6909 274.9440 139.3883 760.2151 136.6019
CNC 6 [ 5 ] 154.8825 436.5923 219.4629 1215.343 1215.343
CNC 6 [ 6 ] 221.0308 632.9817 317.2058 1776.411 310.9049
CNC 6 [ 7 ] 299.4101 855.8344 429.0025 2443.636 424.5764
CNC 6 [ 8 ] 389.4633 1121.645 562.2183 3217.493 556.0342
CNC 6 [ 9 ] 491.3982 1432.679 716.7887 4097.644 705.2066
CNC 6 [ 10 ] 605.4201 1772.087 886.2247 5083.353 871.9638

By using R2013a version of the MatLab, we employ cftool on data in Table 10. Our MatLab program generated the following results with 95% confidence intervals of coefficients: EE ABC 2 ( CNC 6 [ n ] ) = 66.21 ± 12.3 n - 128.3 ± 76.35 , E H ( CNC 6 [ n ] ) = 90 ± 80.2 n - 61.38 ± 497.38 , E GA 2 ( CNC 6 [ n ] ) = 97.46 ± 18.54 n - 197.1 ± 115.06 , EE GA 2 ( CNC 6 [ n ] ) ) = 195.2 ± 37.2 n - 398.4 ± 230.8 , E DD ( CNC 6 [ n ] ) = 561.5 ± 109.4 n - 1168 ± 678 . These results will help in correlation the π -electronic energies of one-hexagonal nanocones with significantly higher accuracy.

7

7 Conclusion

7.1

7.1 Contributions

The following are the main contributions of this paper:

  • We propose a computational method to calculate commonly occurring spectrum-based distance descriptors.

  • Experimental results show that our proposed method possesses less computational complexity and is more computationally diverse.

  • The proposed method is used to calculate commonly occurring spectrum-based distance descriptors to investigate their correlation ability with the experimental data for the two chosen physicochemical properties.

  • Some favorable and some unexpected outcomes have been reported based on the quality testing.

  • Our study contributes towards putting forward the best spectrum-based topological descriptors and meanwhile mentioning the ones which do not deserve further attention of researchers.

7.2

7.2 Implications

The second ABC Estrada index has outperformed all of the well-known spectrum-based distance descriptors. Unlike their reputation among researchers, the harmonic and degree-distance energies also secured spots in the list of best five spectrum-based distance descriptors.

The newly defined second GA energy and Estrada index both secured 3rd and 4th positions in the priority list. This implies that the newly introduced spectral descriptors based on the second ABC and the second GA matrices has performed very well. The results warrant further usage of these newly introduced spectrum-based distance descriptors in the structure–activity and structure–property models. The study also warrants that the well-studied distance energy, the distance Estrada index and the distance Laplacian & signless Laplacian energies and Estrada indices do not deserve as much attention of the researchers as they do in the literature.

7.3

7.3 Limitations

The following are the main limitations of this study:

  • The study is restricted to correlating physicochemical properties only. Structural & surface properties and molecular formations cannot be correlated by using the class of distance-based distance descriptors.

  • The current study is only applicable to aromatic hydrocarbons. Thus, it is restricted to be applied to non-aromatic and anti-aromatic hydrocarbons and their derivative.

  • There might exist other graph-theoretic topological descriptors having better correlations with various physicochemical properties than these spectrum-based valency descriptors. For instance, one could investigate the class of counting related descriptors (Hosoya, 1988).

7.4

7.4 Future study

Based on limitations of this study, it is natural to investigate further research directions in this area. In the quest of finding the best graph-theoretic topological descriptors, we propose to:

  • Investigate predictive potential of graph-theoretic descriptors for determining the structural and atomic configuration related properties of hydrocarbons.

  • Investigate predictive potential of counting related descriptors (Hosoya, 1988) for estimating various physicochemical properties of benzenoid hydrocarbons.

  • Can this study be extended to non-aromatic and anti-aromatic hydrocarbons?

Declarations

Availability of data and materials

The data associated with this manuscript is available in a public repository on GitHub accessible via https://github.com/Sakander/Distance-based-spectral-descriptors.git.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

CRediT authorship contribution statement

Sakander Hayat: Conceptualization, Methodology, Software, Writing- reviewing and editing. Suliman Khan: Data curation, Investigation, Visualization, Writing- original draft preparation. Muhammad Imran: Supervision, Project administration, Funding acquisition.

Acknowledgements

S. Hayat and M. Imran were supported by the University Programme for Advance Research (UPAR) grant of United Arab Emirates University under Grant No. G00003271. S. Hayat is also supported by the Higher Education Commission, Pakistan under Grant No. 20–11682/NRPU/RGM/R&D/HEC/2020. We would like to express our sincere gratitude to the reviewer for his/her helpful comments which have played a vital role in improving the quality and presentation of the original manuscript.

References

  1. , , , . On distance signless Laplacian spectrum and energy of graphs. Electron. J. Graph Theory Appl.. 2018;6(2):326-340.
    [Google Scholar]
  2. , , , . Merging the spectral theories of distance Estrada and distance signless Laplacian Estrada indices of graphs. Mathematics. 2019;7:995.
    [Google Scholar]
  3. , , , . On distance signless Laplacian Estrada index and energy of graphs. Kragujev. J. Math.. 2021;45(6):837-858.
    [Google Scholar]
  4. , , . First-principles prediction of enthalpies of formation for polycyclic aromatic hydrocarbons and derivatives. J. Phys. Chem. A. 2015;119:11329-11365.
    [Google Scholar]
  5. , , . Two Laplacians for the distance matrix of a graph. Linear Algebra Appl.. 2013;439:21-33.
    [Google Scholar]
  6. , , . Distance spectra of graphs: A survey. Linear Algebra Appl.. 2014;458:301-386.
    [Google Scholar]
  7. , , . On the distance signless Laplacian of a graph. Linear Multilinear Algebra. 2016;64:1113-1123.
    [Google Scholar]
  8. , . Experimental results on the energy and Estrada index of HC5C7[4p,8] nanotubes. Optoelectron. Adv. Mater. Rapid Commun.. 2010;4(1):48-49.
    [Google Scholar]
  9. , , . A numerical method for computing energy and estrada index of one-pentagonal carbon nanocones. Optoelectron. Adv. Mater. Rapid Commun.. 2009;3(8):821-822.
    [Google Scholar]
  10. , , , , . Topological indices for structure-activity corrections. Topics Curr. Chem.. 1983;114:21-55.
    [Google Scholar]
  11. , , , . Note on the distance energy of graphs. MATCH Commun. Math. Comput. Chem.. 2010;64:129-134.
    [Google Scholar]
  12. , , . Spectra of Graphs. Heidelberg: Springer; .
  13. , . A theorem in the geometry of position. Cambridge Math. J.. 1841;2:267-271.
    [Google Scholar]
  14. , , . New spectral indices for molecular description. MATCH Commun. Math. Comput. Chem.. 2008;60:3-14.
    [Google Scholar]
  15. , , . On Harary matrix, Harary index and Harary energy. MATCH Commun. Math. Comput. Chem.. 2012;68:815-823.
    [Google Scholar]
  16. , , , . Spectra of Graphs: Theory and Applications. Johann Ambrosius Barth Verlag; .
  17. , , , . On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs. Discrete Appl. Math.. 2018;243:172-185.
    [Google Scholar]
  18. , , . A characterization of the smallest eigenvalue of a graph. J. Graph Theor.. 1994;18:181-194.
    [Google Scholar]
  19. , , , . Szeged matrices and related numbers. MATCH Commun. Math. Comput. Chem.. 1997;35:129-143.
    [Google Scholar]
  20. , , , . Molecular Topology. Huntington: Nova; .
  21. Diudea, M.V., Ursu, O., Nagy, Cs.L., 2002. Topocluj, Babes-Bolyai University, Cluj.
  22. , , . Degree Distance of a graph: a degree analog of the Wiener index. J. Chem. Inf. Comput. Sci.. 1994;34:1082-1086.
    [Google Scholar]
  23. , , , . Science of Fullerenes and Carbon Nanotubes. Academic Press; .
  24. , , , , . An atom-bond connectivity index: modelling the enthalpy of formation of alkanes. Indian J. Chem.. 1998;37A:849-855.
    [Google Scholar]
  25. , , , . On the Szeged and the Laplacian Szeged spectrum of a graph. Linear Algebra Appl.. 2010;433(3):662-671.
    [Google Scholar]
  26. , , , . A new geometric-arithmetic index. J. Math. Chem.. 2010;47:477-486.
    [Google Scholar]
  27. , , . On the addressing problem for loop switching. Bell Syst. Tech. J.. 1971;50:2495-2519.
    [Google Scholar]
  28. , , . A new version of atom-bond connectivity index. Acta Chim. Slov.. 2010;57:609-612.
    [Google Scholar]
  29. , , . On the distance Estrada index of graphs. Hacettepe J. Math. Stat.. 2009;38(3):277-283.
    [Google Scholar]
  30. , , . On the Harary energy and Harary Estrada index of a graph. MATCH Commun. Math. Comput. Chem.. 2010;64:281-296.
    [Google Scholar]
  31. , . Selected properties of the Schultz molecular topological index. J. Chem. Inf. Comput. Sci.. 1994;34:1087-1089.
    [Google Scholar]
  32. , . Degree-based topological indices. Croat. Chem. Acta. 2013;86:351-361.
    [Google Scholar]
  33. Gutman, I., Furtula, B., 2010. Novel Molecular Structure Descriptors – Theory and Applications, Univ. Kragujevac, Kragujevac, Vol. 1 & 2.
  34. , , . Mathematical Concepts in Organic Chemistry. New York: Springer-Verlag; .
  35. , , . Testing the quality of molecular structure descriptors. Vertex-degree-based topological indices. J. Serb. Chem. Soc.. 2013;78:805-810.
    [Google Scholar]
  36. , . Computing distance-based topological descriptors of complex chemical networks: new theoretical techniques. Chem. Phys. Lett.. 2017;688:51-58.
    [Google Scholar]
  37. , , . Computation of topological indices of certain networks. Appl. Math. Comput.. 2014;240:213-228.
    [Google Scholar]
  38. , , . Quality testing of spectrum-based valency descriptors for polycyclic aromatic hydrocarbons with applications. J. Mol. Struct.. 2021;1228:129789-129804.
    [Google Scholar]
  39. , , , . Correlation between the Estrada index and π-electronic energies for benzenoid hydrocarbons with applications to boron nanotubes. Int. J. Quantum. Chem.. 2019;119 e26016
    [Google Scholar]
  40. , , , . An efficient computational technique for degree and distance based topological descriptors with applications. IEEE Access. 2019;7:32276-32296.
    [Google Scholar]
  41. , , , , . Valency-based molecular descriptors for measuring the π-electronic energy of lower polycyclic aromatic hydrocarbons. Polycycl. Aromat. Comp. 2020
    [CrossRef] [Google Scholar]
  42. , , , , . Quality testing of distance-based molecular descriptors for benzenoid hydrocarbons. J. Mol. Struct.. 2020;1222:128927-128935.
    [Google Scholar]
  43. , , , , . Distance-based topological descriptors for measuring the π-electronic energy of benzenoid hydrocarbons with applications to carbon nanotubes. Math. Meth. Appl. Sci. 2020
    [CrossRef] [Google Scholar]
  44. , , , , . QSPR analysis of certain graph theocratical matrices and their corresponding energy. Appl. Math. Nonlin. Sci.. 2017;2:131-150.
    [Google Scholar]
  45. , . On some counting polynomials in chemistry. Discrete Appl. Math.. 1988;19:239-257.
    [Google Scholar]
  46. HyperChem package Release 7.5 for Windows, 2002. Hypercube Inc., 1115 NW 4th Street, Gainesville, Florida 32601, USA.
  47. , . Sharp bounds on the distance spectral radius and the distance energy of graphs. Linear Algebra Appl.. 2009;430:106-113.
    [Google Scholar]
  48. , , , . On distance energy of graphs. MATCH Commun. Math. Comput. Chem.. 2008;60:461-472.
    [Google Scholar]
  49. , . New bounds for the Harary energy and Harary Estrada index of graphs. Math. Asp. Topological Indices. 2019;1(1):40-51.
    [Google Scholar]
  50. , , , . Schultz energy of some graph. Int. J. Sci. Tech. Res.. 2019;8(11):25-30.
    [Google Scholar]
  51. , , , . Graph Energy. Springer Science & Business Media; .
  52. MATLAB 8.0 and Statistics Toolbox 8.1, The MathWorks Inc, Natick, Massachusetts, United States.
  53. , , , . On distance signless Laplacian spectral radius and distance signless Laplacian energy. Mathematics. 2020;8:792.
    [Google Scholar]
  54. , . Sharp bounds on the PI and vertex PI energy of graphs. MATCH Commun. Math. Comput. Chem.. 2011;65:123-130.
    [Google Scholar]
  55. , , , . Comparison between the vertex- and edge-connectivity indices for benzenoid hydrocarbons. J. Chem. Inf. Comput. Sci.. 1998;38:42-46.
    [Google Scholar]
  56. NIST Standard Reference Database, http://webbook.nist.gov/chemistry/.
  57. , , , , . Parabolic reactivity ”coloring” molecular topology: application to carcinogenic PAHs. Curr. Org. Chem.. 2013;17(23):2816-2830.
    [Google Scholar]
  58. , , , . Topological organic chemistry: From distance matrix to Timisoara eccentricity. Curr. Org. Chem.. 2015;19(3):249-2730.
    [Google Scholar]
  59. , , . Minimum covering Gutman energy of a graph. MATTER: Int. J. Sci. Tech.. 2019;5(1):1-11.
    [Google Scholar]
  60. , . Topological organic chemistry 1: Graph Theory and topological indices of alkanes. J. Chem. Inf. Comput. Sci.. 1989;29:227-228.
    [Google Scholar]
  61. , . Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs. PLoS ONE. 2015;10(3) e0123426
    [Google Scholar]
  62. Shang, Y., 2020. Estimating the distance Estrada index, arXiv:1407.5248v1.
  63. , . Spectral Radius of Graphs. Academic Press; .
  64. Stevanović, D., Brankov, V., Cvetković, D., Simić, S. newGRAPH: A Fully Integrated Environment used for Research Process in Graph Theory, http://www.mi.sanu.ac.rs/newgraph/index.html.
  65. , . GAP, Groups. Lehrstuhl De fur Mathematik, RWTH, Aachen: Algorithms and Programming; .
  66. Todeschini, R., Consonni, V., 2009. Molecular Descriptors for Chemoinformatics. Wiley-VCH, Weinheim, Germany, vols. 1 & 2.
  67. , , . Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J. Math. Chem.. 2009;46:1369-1376.
    [Google Scholar]
  68. , . Structural determination of the paraffin boiling points. J. Am. Chem. Soc.. 1947;69:17-20.
    [Google Scholar]
  69. , , , , , . A survey on graphs extremal with respect to distance-based topological indices. MATCH Commun. Math. Comput. Chem.. 2014;71:461-508.
    [Google Scholar]
  70. , , . Discussion of a set of points in terms of their mutual distances. Psychometrika. 1938;3:19-22.
    [Google Scholar]
  71. , , . On distance spectral radius and distance energy of graphs. MATCH Commun. Math. Comput. Chem.. 2010;64:261-280.
    [Google Scholar]
Show Sections