1. Introduction and Preliminary Results
There is a lot of mathematics involved in electrical and electronic engineering. Moreover, this depends on what area of electrical and electronic engineering: for example, there is a lot of abstract mathematics in communication theory, signal processing, networking and others. Networks involve nodes communicating with each other. A number of computers linked together form a network. Cell phone users form a network. Networking involves the study of the best way of implementing a network. Chemists are now equipped with a number of useful tools because of the merging branch of graph theory called chemical graph theory, e.g., molecular topological descriptors, indices and molecular topological polynomials. Many chemical structures and chemical compounds are usually modeled by a molecular graph to analyze underlying theoretical properties. A molecular graph is a pictorial diagram of the structural formula of a chemical structure in terms of graph theory, where the vertices represent the atoms of the given chemical compound and the edges represent the chemical bonds between the atoms. Cheminformatics is new subject which is a combination of chemistry, mathematics and information science. It studies Quantitative structure-activity (QSAR) and structure-property (QSPR) relationships that are used to predict the biological activities and properties of different chemical compounds. In the field of QSAR/QSPR research, theoretical properties of the chemical compounds and their molecular topological indices such as the Wiener index, Szaged index, Randić index, Zagreb index and ABC index are used to predict bioactivity of the chemical compounds. For more details about how to use the topological indices in predicating the bioactivity of chemical compounds, we refer the readers to consult [
1,
2]. For further details of the utilization of the topological indices and better understanding of the topic of research, the readers are hereby referred to the [
3,
4,
5] for references on polymers.
A graph can be recognized by a numeric number, a polynomial, a sequence of number or a matrix. A topological index is a numeric number associated to a graph which completely describes the molecular topology of graph and this quantity is invariant under the automorphism of graphs. Among the interesting and most studied classes of topological indices in chemical graph theory are topological indices, which use the concept of distance called distance-based topological indices. The topological indices defined on the grounds of vertex degrees in a graph are called degree-based topological indices and the topological indices defined on the bases of counting are called counting related topological indices of graphs. Among these classes of topological indices described above, the degree-based topological indices have many more correlations to the chemical properties. In other words, a molecular topological index Top(G) of a graph is the number with the property that for each given graph H which is isomorphic to the graph G, we have Top(H) = Top(G). The concept of topological indices came from Wiener [
6] when he was studying the boiling point of a member of alkane family, called paraffin. He named this topological index the path number. With the increase of research in chemical graph theory, the path number was given the name Wiener index later on. The Wiener index is the most investigated molecular topological index in chemical graph theory because of its interesting theoretical properties and wide range of applications, and because it is equal to the sum of the graph-theoretic distances between every pair of vertices in a graph G, see for details [
7,
8].
Dendrimers are among the most complex chemical and interesting structures and hyper-branched macromolecules, with a precise tailored architecture. Dendrimers have gained a wide range of application in supra-molecular chemistry, particularly in host guest reactions and the self-assembly process. Their application in chemistry, biology and nano-science are unlimited. Recently, the topological indices of certain families of dendrimers have been investigated in [
9,
10,
11,
12,
13,
14,
15].
In this article, G is considered to be a simple and connected graph with vertex set
and edge set
,
is the degree of vertex
and
where
. All notations in this paper are standard and mainly taken from books [
8,
16].
The very first and oldest degree based topological index is
Randić index denoted by
introduced by Milan Randić in 1975 [
17]. It is defined as
One of the well-known degree based topological indices is atom-bond connectivity (ABC) index introduced by Estrada et al. in [
18], which was defined for modeling the enthalpy of formation of alkanes and was defined as follows:
Another well-known connectivity topological descriptor is the geometric-arithmetic (GA) index, which was introduced by Vukičević et al. in [
19]. It was shown that its predictive power is somewhat better than the Randić index for many physicochemical properties like boiling point, entropy, enthalpy of vaporization, standard enthalpy of vaporization, enthalpy of formation and acentric factor, and it was defined as follows:
The fourth version of ABC index is introduced by Ghorbani et al. [
20] and defined as:
Recently fifth version of GA index is proposed by Graovac et al. [
21] and defined as:
Thus, the goal of this paper is to structurally characterize some dendrimers by investigations into these topological indices. The obtained results can be of use in molecular data mining, particularly in researching the uniqueness of tested (hyper-branched) molecular graphs.
Recently, there has been a huge amount of research activity about the
and
topological indices, and their variants, for example, see [
22,
23]. The structure-sensitivity of degree-based molecular topological indices has been discussed in detail in [
22].
and
indices for some families of nanostar dendrimers and polyphenylene dendrimers are discussed in [
20,
21,
24]. For a detailed description, their properties and bounds of the molecular topological indices of various classes of graph, see [
24,
25,
26,
27,
28,
29,
30,
31,
32]. In this paper, we give an explicit formula of the
and
indices for certain nanostar dendrimers, namely PAMAM, tetrathiafulvalene and POPAM dendrimers.
2. Results and Discussion
In this section, we study the
and
indices of some families of dendrimers. We first consider the PAMAM dendrimer of generation
with
growth stages, denoted by
where
. The number of vertices and edges in
are
and
(see [
13]). Denote an edge connecting a vertex
to a vertex
by
edge, where
denote the vertex
and
is the number of
edges. The graph
is shown in
Figure 1.
In the following theorem, the exact formula of index for PAMAM dendrimer is computed.
Theorem 1. Consider the PAMAM dendrimer
. The
index of
is equal to:
Proof. Let G be the graph of PAMAM dendrimer
. We have
and
. We find the edge partition of the form
,
,
,
,
,
for PAMAM dendrimer
based on the degree sum of vertices lying at unit distance from end vertices of each edge.
Table 1 explains such partition for
.
Now by using the partition given in
Table 1, we can compute the
index for
. Since:
this implies that:
After an easy simplification, we obtain:
This completes the proof.
The following theorem computes the index of PAMAM dendrimer .
Theorem 2. Consider the PAMAM dendrimer
. The
index of
is equal to:
Proof. Let G be the graph of the PAMAM dendrimer
. The edge partition of PAMAM dendrimer
based on the degree sum of vertices lying at unit distance from end vertices of each edge is given in
Table 1. Now we apply the formula of
index for
. Since:
this implies that:
After an easy simplification, we get:
This completes the proof.
Now we shall compute the
and
indices of tetrathiafulvalene dendrimer of generation
with
growth stages, denoted by
where
. The graph of
contains
vertices and
edges as shown in
Figure 2 (see [
15]).
Table 2 shows the partition of edge set of tetrathiafulvalene dendrimer
based on the degree sum of vertices lying at unit distance from end vertices of each edge, and by using this partition we compute the
and
indices of tetrathiafulvalene dendrimer
.
In the following theorem, the exact formula of index for tetrathiafulvalene dendrimer is computed.
Theorem 3. Consider tetrathiafulvalene dendrimer
. The
index of
is equal to
Proof. Let G be the graph of tetrathiafulvalene dendrimer
. We have
and
. We find the edge partition of the form
,
,
,
,
,
,
,
,
for tetrathiafulvalene dendrimer
based on the degree sum of vertices lying at unit distance from end vertices of each edge.
Table 2 explains such partition for
.
Now by using the partition given in
Table 2, we can compute the
index for
. Since
this implies that
After an easy simplification, we have
This completes the proof.
Following theorem computes the index of tetrathiafulvalene dendrimer .
Theorem 4. Consider the tetrathiafulvalene dendrimer
. The
index of
is equal to
Proof. Let G be the graph of tetrathiafulvalene dendrimer
. The edge partition of tetrathiafulvalene dendrimer
based on the degree sum of vertices lying at unit distance from end vertices of each edge is given in
Table 2. Now we apply the formula of
index for
. Since:
this implies that:
After an easy simplification, we have:
This completes the proof.
We shall now determine the
and
indices of POPAM dendrimers, denoted by
where
. The number of vertices and edges in
are
and
, respectively (see [
14]).
Figure 3 shows the graph of POPAM dendrimer
with 2 growth stages.
Table 3 shows the partition of edge set of POPAM dendrimer
based on the degree sum of vertices lying at unit distance from end vertices of each edge, and by using this partition we compute the
and
indices of POPAM dendrimer
.
In the following theorem, the exact formula of index for POPAM dendrimer is computed.
Theorem 5. Consider POPAM dendrimer
. The
index of
is equal to
Proof. Let G be the graph of POPAM dendrimer
. We have
and
. We find the edge partition of the form
,
,
,
and
for POPAM dendrimer
based on the degree sum of vertices lying at unit distance from end vertices of each edge.
Table 3 explains such partition for
.
Now, by using the partition given in
Table 3, we can compute the
index for
. Since:
this implies that
After an easy simplification, we get
This completes the proof.
Following theorem computes the index of POPAM dendrimers .
Theorem 6. Consider POPAM dendrimers
. The
index of
is equal to:
Proof. Let G be the graph of POPAM dendrimers
. The edge partition of POPAM dendrimers
based on the degree sum of vertices lying at unit distance from end vertices of each edge is given in
Table 3. Now we apply the formula of
index for
. Since:
After an easy simplification, we get:
This completes the proof.
3. Conclusions
Molecular topology (or topological indices) has widely demonstrated its high performance in the discovery and design of new drugs. With this paper we seek to contribute to a better knowledge of molecular topology among mathematicians. Moreover: molecular topology can be employed to look for drugs that heal, in principle, any disease, based on the structural information provided by known active compounds. Once more, ‘pure’ mathematics comes to the rescue in practical problems, this time in the form of graph theory. If the book of nature is written with numbers, then molecular topology is certainly one way of reading it. Particularly, in this paper, we have considered some families of dendrimers, namely, PAMAM, tetrathiafulvalene and POPAM dendrimers, and studied their topological indices. The analytical closed formulas of the fourth version of atom-bond connectivity index and the fifth version of geometric-arithmetic index for these families of dendrimers are determined. The obtained results can be of useful in molecular data mining, particularly in researching the uniqueness of tested (hyper-branched) molecular graphs. In the future, we are interested to study and compute topological indices of various families of dendrimers/networks which will be quite useful in understanding their underlying topologies.