On Properties of Distance-Based Entropies on Fullerene Graphs

Abstract

In this paper, we study several distance-based entropy measures on fullerene graphs. These include the topological information content of a graph $I_a(G)$, a degree-based entropy measure, the eccentric-entropy $I{f}_{\sigma }(G)$, the Hosoya entropy $H(G)$ and, finally, the radial centric information entropy $H_{ecc}$. We compare these measures on two infinite classes of fullerene graphs denoted by $A_{12n+4}$ and $B_{12n+6}$. We have chosen these measures as they are easily computable and capture meaningful graph properties. To demonstrate the utility of these measures, we investigate the Pearson correlation between them on the fullerene graphs.

1. Introduction

Graph entropy measures have been used in applied network sciences to characterize networks, quantitatively [1,2,3]. Such measures were first introduced in the 1950s in studies of biological and chemical systems. Seminal work in this area was done by Rashevsky [4] and Mowshowitz [3,5,6,7,8], who investigated mathematical properties of entropy measures. IN particular, Mowshowitz [3] interpreted the topological information content of a graph as the entropy of the underlying graph topology. To date, numerous graph entropies have been developed and applied to problems in both theoretical and applied disciplines (see [1,2,3]). Examples include problems in biology, computational biology, mathematical chemistry, web mining, and knowledge engineering concerned with structural properties of networks (see [1,2,3,5,6,7,8,9,10,11,12,13,14,15,16]).

As numerous network measures have been developed so far [3], it is often difficult to choose an appropriate measure for a given class of graphs. This is so for several reasons including the following: (1) The graphs in a given class may be characterized by special structural properties such as symmetry, cyclicity, linearity, and so forth, and not every measure is able to quantify those structural properties in a meaningful way; (2) a particular graph measure relies on a special graph invariant or a combination thereof. For instance, the well-known topological information content $I_a$ [3] has been used as a symmetry measure as it is based on the automorphism group of a graph. Yet, $I_a$ may not be a good measure for distinguishing graphs on cyclicity or other structural properties. In short, the measure one chooses must be appropriate for the structural feature of interest.

A fullerene is a molecule composed of carbon atoms in the form of many shapes such as a hollow sphere, ellipsoid, tube, etc (see [17]). In the mathematical meaning, a fullerene is a cubic 3-connected planar graph with pentagonal and hexagonal faces. For more details of the mathematical aspects of fullerenes, see [18,19,20,21,22]. In this paper, we compare the topological information content of a graph $I_a(G)$, the eccentric-entropy $I{f}_{\sigma }(G)$, the Hosoya entropy $H(G)$, the radial centric information entropy $H_{ecc}$, and a special degree-based entropy on two infinite classes of fullerene graphs, namely $A_{12n+4}$ and $B_{12n+6}$. We emphasize that these measures have already been explored extensively and possess a known structural interpretation. In addition, fullerene graphs play an important role in mathematical chemistry and related disciplines. Therefore, we want to investigate the sensitivity of these five measures to the structural properties of fullerenes. This study is intended as an aid in selecting a measure capable of capturing the structural information of fullerenes. On the other hand, graph measures are at least relevant to the fullerene reactivity [20]. Additionally, entropy-based graph measures may relate to non-equilibrium physicochemical processes (see [23,24]). As for fullerenes, there are direct applications of information entropy to rationalizing the processes of fullerene [25] and endofullerene [26] formation.

2. Concepts and Terminology

All graphs considered in this paper are simple, connected, and finite. Let x and y be two arbitrary vertices of graph G. The distance between x and y is the length of the shortest path connecting them, denoted by $d(x,y)$.

Let $\Gamma$ be a group and $\Omega$ be a non-empty set. An action of group $\Gamma$ on set $\Omega$ is a function $\phi :\Gamma \times \Omega \to \Omega$, where $(g,\alpha )\to \phi (g,\alpha )$, that satisfies the following two properties (we denote $\phi (g,\alpha )$ as ${\alpha }^g$): ${\alpha }^e=\alpha$ for all $\alpha$ in $\Omega$ and ${({\alpha }^g)}^h={\alpha }^{gh}$ for all $g,h$ in $\Gamma$. The orbit of an element $\alpha \in \Omega$ is denoted by ${\alpha }^{\Gamma }$, and it is defined as the set of all ${\alpha }^g,g\in \Gamma$.

Let $X=(V,E)$ be a graph with vertex set V and edge set E. A bijection f on V that preserves edge set E is called an automorphism of X. In other words, the bijection f on $V(X)$ is an automorphism if and only if $f(u)f(v)$ is an edge in E (the image of vertex u is denoted by $f(u)$) whenever $e=uv$ is an edge in E. The set of all automorphisms of X, denoted by $Aut(X)$, forms a group under the composition of mappings. This group acts transitively on the set of vertices if for any pair of vertices u and v in $V(X)$, there is an automorphism $g\in Aut(X)$ such that $g(u)=v$. In this case, we say that X is vertex-transitive. An edge-transitive graph can be defined similarly.

The stabilizer of a vertex v under the action of $A=Aut(G)$ is the set of automorphisms that fix v and is denoted by $A_v$. A group-theoretic result of special importance regarding the proofs in Section 4 is the orbit-stabilizer theorem, which states that $|v^A\left|\right|A_v|=|A|$.

3. Entropy of Graphs

The general Shannon entropy [27] is defined by ${\displaystyle I(p)=-\sum _{i=1}^n{p}_{i}log(p_i)}$ for finite probability vector p. Let $\lambda ={\sum }_{j=1}^n{\lambda }_j$ and $p_i={\lambda }_i/\lambda ,(i=1,2,\dots ,n).$ Generally, the entropy of an n-tuple $({\lambda }_1,{\lambda }_2,\dots ,{\lambda }_n)$ of real numbers is given by

$$I({\lambda }_1,{\lambda }_2,\dots ,{\lambda }_n)=-\sum _{i=1}^n{p}_{i}log(p_i)=log\left(\sum _{i=1}^n{\lambda }_i\right)-\sum _{i=1}^n\frac{{\lambda }_i}{{\sum }_{j=1}^n{\lambda }_j}log{\lambda }_i.$$

(1)

There are many different ways to associate an n-tuple $({\lambda }_1,{\lambda }_2,\dots ,{\lambda }_n)$ to a graph G (see [1,2,8,10,11,12,13,14,15,16,28]). A classical graph entropy measure, namely the topological information content due to Mowshowitz [3], is defined by

$$I_a(G)=-\sum _{i=1}^k\frac{\left|N_i\right|}{\left|V\right|}log\left(\frac{\left|N_i\right|}{\left|V\right|}\right),$$

(2)

where $N_i$ (1 ≤ i ≤ k) is a set of similar vertices (which means they are in the same orbit). The collection of k orbits $N_1,\dots ,N_k$ defines a finite probability scheme in an obvious way. It is well-known that $I_a$(G) reaches its maximum value for an identity graph, i.e., one whose automorphism group consists of the identity alone [3].

Entropy measures have been applied to networks/graphs extensively (see, e.g., [1,2,3]). There are many so-called information functionals that can be used to characterize a graph by means of an entropy measure defined by Equation (3). Because vertex eccentricity has meaningful properties (see [28,29]), we will apply this measure in our analysis together with other graph entropies. The eccentricity of vertex v is $\sigma (v)=ma{x}_{u\in V}d(u,v)$, where $d(u,v)$ is the distance between vertices u and v. For a vertex $v_i\in V$, we define f as $f(v_i):=c_i\sigma (v_i)$ where $c_i>0$ for $1\le i\le n$ (see [3]). The entropy based on f denoted by $I{f}_{\sigma }(G)$ is defined as follows:

$$\begin{array}{c}\hfill {\displaystyle I{f}_{\sigma }(G)=log\left({\displaystyle \sum _{i=1}^n{c}_i\sigma (v_i)}\right)-\sum _{i=1}^n\frac{c_i\sigma (v_i)}{{\displaystyle \sum _{j=1}^n{c}_j\sigma (v_j)}}log(c_i\sigma (v_i)).}\end{array}$$

(3)

If $c_i^{\prime }s$ are equal, then

$$\begin{array}{c}\hfill {\displaystyle I{f}_{\sigma }(G)=log\left({\displaystyle \sum _{i=1}^n\sigma (v_i)}\right)-\sum _{i=1}^n\frac{\sigma (v_i)}{{\displaystyle \sum _{j=1}^n\sigma (v_j)}}log(\sigma (v_i)).}\end{array}$$

(4)

For further information about existing graph entropy measures, see [3,10,30,31,32,33,34].

In addition, we apply a special degree-based entropy $D(G)$ defined by [3]

$$\begin{array}{c}\hfill {\displaystyle D(G)=log\left({\displaystyle \sum _{i=1}^n{c}_{i}deg(v_i)}\right)-\sum _{i=1}^n\frac{c_{i}deg(v_i)}{{\displaystyle \sum _{j=1}^n{c}_{j}deg(v_j)}}log(c_{i}deg(v_i)).}\end{array}$$

(5)

It is evident that other degree-based entropies can be defined as well (e.g., see [35]). If $c_i^{,}s$ are equal, since ${\sum }_{i=1}^{n}deg(v_i)=2m$, where m is the number of edges, we obtain

$$\begin{array}{c}\hfill {\displaystyle D(G)=log(2m)-\frac{1}{2m}\sum _{i=1}^{n}deg(v_i)log(deg(v_i)).}\end{array}$$

(6)

Given a graph G and a vertex $u\in V(G)$, let ${\Gamma }_i(u)$ be the number of vertices at distance ifrom u. Two vertices u and v are said to be Hosoya-equivalent or H-equivalent [8] if ${\Gamma }_i(u)={\Gamma }_i(v)$ for 1 ≤i≤d(G). The family of sets of H-equivalent vertices constitutes a partition of the vertices. Let h be the number of sets of H-equivalent vertices in G. The Hosoya entropy (or H-entropy) of G (introduced in [8]) is given by

$$H(G)=-\sum _{i=1}^h\frac{|X_i|}{\left|V\right|}log\left(\frac{|X_i|}{\left|V\right|}\right).$$

(7)

Another entropy measure we use here relates to vertex eccentricity. The eccentric-entropy of graph G denoted by $C_{ec}(G)$ is defined by the number of different eccentricities of vertices [35]. Let $C_{ec}(G)=k$ and $Y_{i_1},\cdots ,Y_{i_k}$ be the sets of the different eccentricities. For instance, $Y_{i_j}$, $1\le j\le k$ is the set of all vertices with eccentricity equal to $i_j$. Then, the radial centric information entropy (or simply radial entropy) is defined by [36]

$$\begin{array}{c}\hfill {\displaystyle H_{ecc}=-\sum _{i=1}^k\frac{|Y_i|}{\left|V\right|}log\left(\frac{|Y_i|}{\left|V\right|}\right).}\end{array}$$

(8)

The eccentric sequence of a connected graph G represents a list of the eccentricities of its vertices in non-decreasing order. Since there are often many vertices having the same eccentricity, we simplify the sequence by listing them as

$$\left\{\sigma {(v_1)}^{m_1},\sigma {(v_2)}^{m_2},\cdots ,\sigma {(v_k)}^{m_k}\right\}.$$

$\sigma (v_i)$ is the eccentricity of $v_i$; $m_i$ is the multiplicity of $\sigma (v_i)$.

4. Main Results

In this section, we consider two infinite classes of fullerene graphs $A_{12n+4}$ and $B_{12n+6}$. Group-theoretic methods are used to determine the orbits of their respective automorphism groups, enabling the computation of symmetry-based entropy. Hosoya entropy is also computed using a method [29] for inferring Hosoya partitions.

In addition, we determine the eccentricity sequence of a fullerene graph, and we calculate the radial centric entropy. Eccentricity entropy and degree-based entropy, defined in the previous section, are also computed. Finally, in Section 4, we compare these entropies in relation to properties of the graphs.

Lemma 1.

[37] If G is a vertex-transitive graph, then for all $x,y\in V(G)$, $\sigma (x)=\sigma (y)$, i.e., all the vertices in a vertex-transitive graph have the same eccentricity.

Theorem 1.

[38] Let G be a vertex-transitive graph on n vertices and $\sigma (x)$ denote the eccentricity of vertex x. For all sequences $c_1\ge c_2\ge \cdots \ge c_n$

$${\displaystyle I{f}_{\sigma }(G)=log\left({\displaystyle \sum _{i=1}^n{c}_i}\right)-\sum _{i=1}^n\frac{c_i}{{\displaystyle \sum _{j=1}^n{c}_j}}log(c_i).}$$

(9)

If $c_i=c_j$ for all $i\ne j$, then $I{f}_{\sigma }(G)=log(n)$.

Let $x_1,x_2$ be positive integers. It is clear that the inequality

$${(x_1+x_2)}^{(x_1+x_2)}>x_1^{x_1}{x}_2^{x_2},$$

(10)

is satisfied. We are aware of the fact that the Hosoya partition is either an orbit or a union of distinct orbits. Thus, using Equation (10), we conclude that for an arbitrary graph G, we infer

$$H_{ecc}(G)\le H(G)\le I_a(G).$$

(11)

It is not difficult to see that the diameter of $A_{12n+4}$ is $d=2n+1$. Suppose that for $1\le i\le n$, $C_i$ is the subset of vertices of $A_{12n+4}$ at distance $2i-1$ or $2i$ from the vertex 1, and $C_{n+1}=\{12n,\dots ,12n+4\}$. In other words, for $1\le i\le n$, $C_i={\Gamma }_{2i-1}(1)\cup {\Gamma }_{2i}(1)$ and $C_{n+1}={\Gamma }_{2n+1}(1)$, where ${\Gamma }_i(u)$ is defined in Section 3.

Definition 1.

The i-th layer ($1\le i\le n$) of a fullerene graph $A_{12n+4}$ is the set of vertices contained in $C_i$.

Theorem 2.

Consider the fullerene graph $A_{12n+4}$, where $n\ge 4$. If n is even, then

$$I_a(A_{12n+4})=log(12n+4)-\frac{1}{12n+4}\left((12n+3)log3+6n\right).$$

(12)

If n is odd, then

$$I_a(A_{12n+4})=log(12n+4)-\frac{1}{12n+4}\left((12n+3)log3+6n+6\right).$$

(13)

Proof. 

Consider the labeling of the fullerene graph $A_{12n+4}$ as shown in Figure 1, and set $\alpha =(2,5,8)(3,6,9)\dots (12n+2,12n+4,12n)$ and $\beta =(2,8)(3,7)\dots (12n+2,12n)$.

Clearly, $S_3\cong 〈\alpha ,\beta 〉\le A=Aut(A_{12n+4})$. On the other hand, $\left|A\right|=|1^A\left|\right|A_1|$. Since each automorphism that fixes points 1 and 2 must fix $\{7,11,17,\cdots 12n-1,12n+2\}$, $|A_1|=|A_{1,2}\left|\right|2^{A_1}|=2\times 3$. Moreover, $1^A=\{1\}$, and thus $\left|A\right|=6$, which implies that $A\cong S_3.$

The vertex 1 constitutes a singleton orbit. The vertices of the first layer of this graph constitute two orbits,

$$\{2,5,8\},\{3,4,6,7,9,10\}.$$

On the other hand, the i-th layer $(2\le i\le n)$ consists of three orbits. The vertices of the i-th layer of $A_{12n+4}$ that are the same color (in Figure 2) are in the same orbit.

If n is even, the vertices of the last layer of Figure 1 make up two orbits: the vertices with odd labels (colors) form one orbit, and the other vertices form a second orbit. If n is odd, the vertices of the last layer are in the same orbit. Thus, if n is even, the fullerene graph $A_{12n+4}$ possesses one orbit of size 1, $2n+1$ orbits of size 3, and n orbits of size 6. Thus,

$$\begin{array}{ccc}\hfill I_a(A_{12n+4})& =& \frac{1}{12n+4}log(12n+4)+\frac{3(2n+1)}{12n+4}log\left(\frac{12n+4}{3}\right)\hfill \end{array}$$

$$\begin{array}{c}+\frac{6n}{12n+4}log\left(\frac{12n+4}{6}\right)\hfill \end{array}$$

(14)

$$\begin{array}{c}=log(12n+4)-\left(\frac{6n+3}{12n+4}log3+\frac{6n}{12n+4}(1+log3)\right)\hfill \end{array}$$

(15)

$$\begin{array}{c}=log(12n+4)-\frac{1}{12n+4}\left((12n+3)log3+6n\right).\hfill \end{array}$$

(16)

If n is odd, the fullerene graph $A_{12n+4}$ has one orbit of size 1, $2n-1$ orbits of size 3, and $n+1$ orbits of size 6. Hence,

$$\begin{array}{ccc}\hfill I_a(A_{12n+4})& =& \frac{1}{12n+4}log(12n+4)+\frac{3(2n-1)}{12n+4}log\left(\frac{12n+4}{3}\right)\hfill \end{array}$$

$$\begin{array}{c}+\frac{6(n+1)}{12n+4}log\left(\frac{12n+4}{6}\right)\hfill \end{array}$$

(17)

$$\begin{array}{c}=log(12n+4)-\left(\frac{6n-3}{12n+4}log3+\frac{6(n+1)}{12n+4}(1+log3)\right)\hfill \end{array}$$

(18)

$$\begin{array}{c}=log(12n+4)-\frac{1}{12n+4}\left((12n+3)log3+6n+6\right).\hfill \end{array}$$

(19)

 □

Theorem 3.

The fullerene graph $A_{12n+4}$ where $n\ge 4$ satisfies

$$H(A_{12n+4})=log(12n+4)-\frac{1}{12n+4}\left((12n+3)log3+6(2n-4)\right).$$

(20)

Proof. 

Consider the graph shown in Figure 2. Each set of H-equivalent vertices in the i-th ($i=1,2,3,4,5$) layer forms a distinct orbit. For $i=6,7,\cdots ,n$, the vertices of each layer constitute three orbits labeled by the numbers 1, 2, and 3. In all of them, vertices with labels 2 and 3 compose H-equivalent partitions and the vertices with label 1 compose another H-equivalent partition. Finally, the vertices of the outer pentagon in $A_{12n+4}$ are also H-equivalent.

This means that the vertices of fullerene graph $A_{12n+4}$ are partitioned into $2n+6$H-equivalence classes such that there exists an equivalence class of size 1, nine equivalence classes of size 3, and $2n-4$ equivalence classes of size 6. Hence,

$$\begin{array}{ccc}\hfill H(A_{12n+4})& =& \frac{1}{12n+4}log(12n+4)+\frac{27}{12n+4}log\left(\frac{12n+4}{3}\right)\hfill \end{array}$$

$$\begin{array}{c}+\frac{6(2n-4)}{12n+4}log\left(\frac{12n+4}{6}\right)\hfill \end{array}$$

(21)

$$\begin{array}{c}=log(12n+4)-\left(\frac{27}{12n+4}log3+\frac{6(2n-4)}{12n+4}(1+log3)\right)\hfill \end{array}$$

(22)

$$\begin{array}{c}=log(12n+4)-\frac{1}{12n+4}\left(12n-24+(12n+3)log3\right).\hfill \end{array}$$

(23)

Carbon nanotubes are members of the fullerene family. A carbon nanotube ($T_z[m,n]$) consists of a sheet with m rows and n columns of hexagons (see Figure 3). Nanotubes can be pictured as sheets of graphite rolled up into a tube, as shown in Figure 4. Combining a nanotube $T_z[6,n-10]$ with two copies of $B_1$ and $B_2$ (Figure 5 and Figure 6) yields the fullerene graph $A_{12n+4}$ (see Figure 7).  □

The vertices of fullerene graph $A_{12n+4}$ can be partitioned into three subsets of vertices: the vertices of $B_1$, $B_2$ and the vertices of the nanotube $T_z[6,n-10]$ (see Figure 5, Figure 6, and Figure 8). The blocks of the Hosoya partition and the eccentricities of the vertices of $B_1$ and $B_2$ are given in

Table 1. The H-partition and eccentricity of fullerene graph.

Partitions	Elements	ecc
$V_1$	1	$2n+1$
$V_{2n+6}$	$12n-1,12n,12n+1,12n+2,12n+3,12n+4$
$V_2$	$2,5,8$	$2n$
$V_{2n+5}$	$12n-13,12n-11,12n-912n-7,12n-5,12n-3$
$V_3$	$3,4,6,7,9,10$	$2n-1$
$V_{2n+4}$	$12n-12,12n-10,12n-812n-6,12n-4,12n-2$
$V_4$	$12,14,16,18,20,22$	$2n-2$
$V_{2n+3}$	$12n-25,12n-23,12n-21,12n-19,12n-17,12n-15$
$V_5$	$11,15,19$	$2n-3$
$V_6$	$13,17,21$
$V_{2n+2}$	$12n-24,12n-22,12n-20,12n-18,12n-16,12n-14$
$V_7$	$23,27,31$	$2n-4$
$V_8$	$25,29,33$
$V_{2n+1}$	$12n-36,12n-34,12n-32,12n-30,12n-28,12n-26$
$V_9$	$24,26,28,30,32,34$	$2n-5$
$V_{2n}$	$12n-37,12n-35,12n-33,12n-31,12n-29,12n-27$
$V_{10}$	$36,38,40,42,44,46$	$2n-6$
$V_{2n-1}$	$12n-49,12n-47,12n-45,12n-43,12n-41,12n-39$
$V_{11}$	$35,39,43$	$2n-7$
$V_{12}$	$37,41,45$
$V_{2n-2}$	$12n-48,12n-46,12n-44,12n-42,12n-40,12n-38$
$V_{13}$	$47,51,55$	$2n-8$
$V_{14}$	$49,53,57$
$V_{2n-3}$	$12n-60,12n-58,12n-56,12n-54,12n-52,12n-50$
$V_{15}$	$48,50,52,54,56,58$	$2n-9$
$V_{2n-4}$	$12n-61,12n-59,12n-57,12n-55,12n-55,$
	$12n-53,12n-51$

.

Now consider the nanotube $T_z[6,n-10]$ in fullerene graph $A_{12n+4}$. Each layer of this graph has two equivalence classes (see Figure 8). Let $p_1,\dots ,p_{n-10}$ be the Hosoya-equivalent vertices of $T_z[6,n-10]$, i.e., the set $p_i$ contains the vertices labeled i. Then $ecc(p_i)=2n-i-9$, where for the subset $X\subseteq V(G)$, $ecc(X)=max\{ecc(x):x\in X\}$.

Thus, the eccentricity sequence of fullerene graph $A_{12n+4}$ is

$$\left\{{(2n-i)}^{12}(1\le i\le n-1),{(2n)}^9,{(2n+1)}^7\right\}.$$

(24)

Theorem 4.

The radial entropy of fullerene $A_{12n+4}(n\ge 4)$ is

$$\begin{array}{cc}\hfill H_{ecc}(A_{12n+4})& =log(12n+4)\hfill \\ & -\frac{1}{12n+4}\left(24(n-1)+(12n+6)log3+7log7\right).\hfill \end{array}$$

(25)

Proof. 

From Equation (24), we obtain

$$\begin{array}{ccc}\hfill H_{ecc}(A_{12n+4})& =& \frac{12(n-1)}{12n+4}log\left(\frac{12n+4}{12}\right)+\frac{9}{12n+4}log\left(\frac{12n+4}{9}\right)\hfill \end{array}$$

$$\begin{array}{cc}+& \frac{7}{12n+4}log\left(\frac{12n+4}{7}\right)\hfill \end{array}$$

(26)

$$\begin{array}{cc}=& log(12n+4)-\frac{1}{12n+4}\left(12(n-1)log12+9log9+7log7\right)\hfill \end{array}$$

(27)

$$\begin{array}{cc}=& log(12n+4)-\frac{1}{12n+4}\left(24(n-1)+(12n+6)log3+7log7\right).\hfill \end{array}$$

(28)

 □

Theorem 5.

If $c_i$’s are equal in Equation (5), the entropy of fullerene $A_{12n+4}(n\ge 11)$ is given by

$$\begin{array}{cc}\hfill I{f}_{\sigma }(A_{12n+4})& =log(18n^2+14n+7)\hfill \\ & -\frac{1}{18n^2+14n+7}\left((14n+7)log(2n+1)\right)\hfill \\ & +18nlog(2n)+12A),\hfill \end{array}$$

(29)

where ${\displaystyle A=\sum _{i=1}^{n-1}(2n-i)log(2n-i)}$.

Proof. 

From Table 1, assuming $n\ge 11$, it is clear that there are $n+1$ types of vertices of the fullerene graph $A_{12n+4}$ with distinct eccentricities. From Equation (24), one can see that there exist 7 vertices with eccentricity $2n+1$, 9 vertices with eccentricity $2n$, and 12 vertices with eccentricity $2n-i(1\le i\le n-1)$. From this, we conclude that

$$\begin{array}{cc}\hfill I{f}_{\sigma }(A_{12n+4})& {\displaystyle =log\left(7(2n+1)+9(2n)+12\sum _{i=1}^{n-1}(2n-i)\right)}\hfill \\ & -\frac{1}{{\displaystyle 32n+7+12\sum _{i=1}^{n-1}(2n-i)}}(7(2n+1)log(2n+1)\hfill \\ & +9(2n)log(2n)+12A))=log(18n^2+14n+7)\hfill \\ & -\frac{1}{18n^2+14n+7}\left((14n+7)log(2n+1)\right)\hfill \\ & +18nlog(2n)+12A.\hfill \end{array}$$

(30)

 □

Theorem 6.

The degree-based entropy of fullerene graph $A_{12n+4}$ is

$$D(A_{12n+4})=log(36n+12)-\frac{(36n+12)log3}{36n+12}=log(12n+4).$$

(31)

Theorem 7.

Let $B_{12n+6}$ be the fullerene graph with $n\ge 6$. Then

$$I_a(B_{12n+6})=log(12n+6)-\frac{10n+5}{6n+3}.$$

(32)

Proof. 

Consider the graph $B_{12n+6}$ shown in Figure 9. Clearly, $\alpha ,\beta$ are automorphisms of fullerene graph $B_{12n+6}$:

$$\begin{array}{c}\alpha =(1,5)(2,4)(6,8)\dots (12n+1,12n+4)(12n+2,12n+3)(12n+5,12n+6),\hfill \\ \beta =(2,8)(3,7)(4,6)\dots (12n+3,12n+5)(12n+2,12n+6).\hfill \end{array}$$

Then $G=\langle \alpha ,\beta \rangle \le A=Aut(B_{12n+6})$. Since every automorphism that fixes point 3 also fixes the points $\{7,26,27,33,\dots ,12n-8,12n-2\}$, the orbit-stabilizer property implies that $\left|A\right|=|3^A\left|\right|A_3|=2\times 2$. Therefore, $A\cong {\mathbb{Z}}_2\times {\mathbb{Z}}_2.$ The graph $B_{12n+6}$ has $n+1$ layers. The orbits of the first and last layers are given by

$$\begin{array}{c}\{1,5\},\{2,4,6,8\},\{3,7\},\{12,13,19,20\},\{12n+1,12n+4\},\hfill \\ \{12n+2,12n+3,12n+5,12n+6\}.\hfill \end{array}$$

Moreover, the vertices of the i-th layer $(2\le i\le n)$ of $B_{12n+6}$ that have the same color in Figure 10 are in the same orbit. This means that the graph $B_{12n+6}$ possesses $2n+1$ orbits of size 2 and $2n+1$ orbits of size 4. Thus,

$$\begin{array}{ccc}\hfill I_a(B_{12n+6})& =& \frac{2(2n+1)}{12n+6}log\left(\frac{12n+6}{2}\right)+\frac{4(2n+1)}{12n+6}log\left(\frac{12n+6}{4}\right)\hfill \end{array}$$

(33)

$$\begin{array}{cc}=& \frac{2n+1}{6n+3}\left(log(12n+6)-1\right)+\frac{4n+2}{6n+3}\left(log(12n+6)-2\right)\hfill \end{array}$$

(34)

$$\begin{array}{cc}=& log(12n+6)-\frac{10n+5}{6n+3}.\hfill \end{array}$$

(35)

 □

Theorem 8.

Suppose $B_{12n+6}$ is the fullerene graph with $n\ge 6$. Then

$$H(B_{12n+6})=log(12n+6)-\frac{1}{12n+6}\left(6(2n-8)(1+log3)+90\right).$$

(36)

Proof. 

In Figure 10, the sets of Hosoya-equivalent vertices in layers 1, 2, and 3 are precisely the orbits of the automorphism group. For $i\in \{4,5,6\}$, consider the i-th layer of fullerene $B_{12n+6}$. The vertices labeled 2 and 4 form two blocks of the Hosoya partition. The vertices labeled 1 and 3 form two additional blocks. In the layers i, $(7\le i\le n)$, the vertices labeled by 2 and 4 form two blocks, and the vertices labeled by 1 and 3 form an additional two blocks. Finally, the vertices of the last layer are all H-equivalent. Hence, the Hosoya partition of this graph consists of nine blocks of size 2, nine of size 4, and $2n-8$ of size 6. Thus, we have

$$\begin{array}{ccc}\hfill H(B_{12n+6})& =& \frac{18}{12n+6}log\left(\frac{12n+6}{2}\right)+\frac{36}{12n+6}log\left(\frac{12n+6}{4}\right)\hfill \\ & +& \frac{6(2n-8)}{12n+6}log\left(\frac{12n+6}{6}\right)=\frac{3}{2n+1}\left(log(12n+6)-1\right)\hfill \\ & +& \frac{6}{2n+1}\left(log(12n+6)-2\right)\hfill \end{array}$$

$$\begin{array}{cc}+& \frac{2n-8}{2n+1}log\left((12n+6)-log6\right)\hfill \end{array}$$

(37)

$$\begin{array}{cc}=& log(12n+6)-\frac{1}{2n+1}\left((2n-8)(1+log3)+15\right).\hfill \end{array}$$

(38)

 □

Theorem 9.

If $c_i$’s are equal in Equation (5), then the entropy of fullerene $B_{12n+6}(n\ge 12)$ is

$$\begin{array}{ccc}\hfill I{f}_{\sigma }(B_{12n+6})& =& log(18n^2+18n+8)\hfill \end{array}$$

(39)

$$\begin{array}{cc}-& \frac{1}{9/2n^2+9/2+2}\left((4n+2)log(2n+1)+5nlog(2n)+3A\right),\hfill \end{array}$$

(40)

where ${\displaystyle A=\sum _{i=1}^{n-1}(2n-i)log(2n-i)}$.

Proof. 

There exist $n+1$ types of vertices of fullerene graphs $B_{12n+6}$ whose eccentricity sequence is

$$\begin{array}{c}\hfill \left\{{(2n-i)}^{12}(1\le i\le n-1),{(2n)}^{10},{(2n+1)}^8\right\}.\end{array}$$

(41)

There exist 8 vertices with eccentricity $2n+1$, 10 vertices with eccentricity $2n$, and 12 vertices with eccentricity $2n-i(1\le i\le n-1)$. We conclude that

$$\begin{array}{ccc}\hfill I{f}_{\sigma }(B_{12n+6})& =& {\displaystyle log\left(8(2n+1)+10(2n)+12\sum _{i=1}^{n-1}(2n-i)\right)}\hfill \\ & -& \frac{1}{{\displaystyle 32n+7+12\sum _{i=1}^{n-1}(2n-i)}}(8(2n+1)log(2n+1)\hfill \end{array}$$

$$\begin{array}{cc}+& 10(2n)log(2n)+12A))\hfill \end{array}$$

(42)

$$\begin{array}{cc}=& log(18n^2+18n+8)\hfill \\ -& \frac{1}{9/2n^2+9/2n+2}((4n+2)log(2n+1)\hfill \end{array}$$

$$\begin{array}{cc}+& 5nlog(2n)+3A)).\hfill \end{array}$$

(43)

 □

Theorem 10.

The radial entropy of fullerene $B_{12n+6}(n\ge 6)$ is

$$H_{ecc}(B_{12n+6})=log(12n+6)-\frac{1}{12n+6}\left(12(n-1)log3+10log5+24n+10\right).$$

(44)

Proof. 

By using Equation (41), we infer

$$\begin{array}{c}{H}_{ecc}(B_{12n+6})=\frac{12(n-1)}{12n+6}log\left(\frac{12n+6}{12}\right)+\frac{10}{12n+6}log\left(\frac{12n+6}{10}\right)\hfill \end{array}$$

$$\begin{array}{c}+\frac{8}{12n+6}log\left(\frac{12n+6}{8}\right)\hfill \end{array}$$

(45)

$$\begin{array}{c}=log(12n+6)-\frac{1}{12n+6}\left(12(n-1)log12+10log10+8log8\right)\hfill \end{array}$$

(46)

$$\begin{array}{c}=log(12n+6)-\frac{1}{12n+6}\left(12(n-1)log3+10log5+24n+10\right).\hfill \end{array}$$

(47)

 □

Theorem 11.

The degree-based entropy $D(B_{12n+6})$ is

$$D(B_{12n+6})=log(36n+18)-\frac{(36n+18)log3}{36n+18}=log(12n+6).$$

(48)

Correlation Analysis

In Figure 11 and Figure 12, the values of five entropies (introduced in this paper) are compared for 80 fullerene graphs contained in $A_{12n+4}$ and $B_{12n+6}$. Here, the X-axis denotes the values of n and the Y-axis denotes the the values of graph entropies. As a result, one can see that the correlation between degree-based entropy and eccentric-entropy is approximately equal to one.

The Pearson correlations between the entropies for the fullerenes $A_{12n+4}$ and $B_{12n+6}$ can be found in Figure 13 and Figure 14.

The adjacency energy of G is a graph invariant that was introduced by Gutman [39]. It is defined as

$$\begin{array}{c}\hfill E(G)={\displaystyle \sum _{i=1}^n}\left|{\lambda }_i\right|,\end{array}$$

(49)

where ${\lambda }_i$s are the eigenvalues of G. In this paper, we computed the energy of a graph and five types of entropies for $A_{12n+4}$ ($11\le n\le 20$) fullerene graphs (see

Table 2. The graph energy and five kinds of entropies applied to $A_{12n+4}$.

n	E	D	${\mathit{If}}_{\mathit{\sigma }}$	${\mathit{I}}_{\mathit{a}}$	H	${\mathit{H}}_{\mathit{ecc}}$
11	212.87	7.08	7.06	5.02	4.72	3.57
12	231.73	7.2	7.18	5.14	4.82	3.68
13	250.59	7.32	7.29	5.25	4.92	3.79
14	269.46	7.42	7.39	5.36	5.01	3.89
15	288.32	7.52	7.49	5.45	5.09	3.98
16	307.19	7.61	7.58	5.54	5.18	4.07
17	326.05	7.7	7.67	5.63	5.25	4.15
18	344.91	7.78	7.75	5.71	5.33	4.23
19	363.78	7.85	7.83	5.78	5.4	4.31
20	382.64	7.93	7.9	5.86	5.46	4.38

). These results reveal that the correlation between graph energy and any type of entropy applied to the class of $A_{12n+4}$ fullerenes is greater than 0.99 (see

Table 3. The correlation between graph energy and entropies applied to $A_{12n+4}$.

	$\mathit{E},\mathit{D}$	$\mathit{E},{\mathit{If}}_{\mathit{\sigma }}$	$\mathit{E},{\mathit{I}}_{\mathit{a}}$	$\mathit{E},\mathit{H}$	$\mathit{E},{\mathit{H}}_{\mathit{ecc}}$
Cor	0.9964006	0.9972326	0.99673	0.9975728	0.9974525

). This means that they capture almost the same kind of structural information. Finally, we are able to approximate the graph energies of fullerenes by these entropies.

5. Summary and Conclusions

In this paper, we have examined several known graph entropy measures on fullerene graphs. In particular, we explored the topological information content of a graph $I_a(G)$, a degree-based entropy measure, the eccentric-entropy $I{f}_{\sigma }(G)$, the Hosoya entropy $H(G)$, and finally, the radial centric information entropy $H_{ecc}$. Our results are twofold. First, we obtained concrete expressions for the graph entropy measures on the defined classes of fullerenes. These results can be useful when applying the measures on the fullerenes for practical applications. Second, we generated numerical results to examine the correlations between the measures. We found that almost all measures are highly correlated. This means that it might be sufficient to use only one measure to quantify the structural properties of fullerenes. On the one hand, this could be interpreted as a negative result in that it might not be worthwhile to apply many measures that seem to be different since they rely on quite different graph invariants. However, it turns out that they capture almost the same kind of structural information, as measured by the Pearson correlation coefficient. On the other hand, this fact could be used to approximate other measures that are difficult to determine analytically. In Hückel theory, the total $pi$-electron energy of a bipartite molecular graph is defined as the formula given by Equation (49). Our measure of energy correlates well with the observed heats of formation of the corresponding conjugated hydrocarbons, and it is related to other relevant chemical invariants [39,40]. We demonstrated this by using the well-known graph energy [41,42,43,44,45,46,47,48].

In the future, we intend to examine these measures on other classes of graphs and to analyze extremal properties as well as interrelations between the measures.