A STUDY ON SQUARE REVERSE INDEX AND ITS POLYNOMIAL

OF CERTAIN NETWORKS

A project report submitted to the

Government Arts College for Women (Autonomous)

Accredited with B++ by NAAC and affiliated to

Bharathidhasan University, Trichirappalli

In partial fulfillment of the requirements

For the award of the Degree of

MASTER OF SCIENCE

IN

MATHEMATICS

Submitted by

M. ABINAYA

REG. NO: P18S1501

Guided by

Mrs. R. ROHINI M.Sc., M. Phil.,

Department of mathematics

GOVERNMENT ARTS COLLEGE FOR WOMEN (AUTONOMOUS)

PUDUKKOTTAI - 622 001

2019-2020
 Government Arts College for Women (Autonomous)

Accredited with B++ by NAAC

PUDUKKOTTAI - 622 001

CERTIFICATE

This is to certify that the project work entitled “SQUARE REVERSE

INDEX AND ITS POLYNOMIAL OF CERTAIN NETWORKS”
submitted by selvi M. ABINAYA (Register No. P18S1501) in partial
fulfillment of the requirements for the award of the Degree of MASTER OF
SCIENCE IN MATHEMATICS of BHARATHIDHASAN UNIVERSITY,
TRICHIRAPPALLI, during the academic year (2019-2020) is the bonafide
record of the work carried out under my supervision and guidance.

Signature of the Guide

Signature of Head of the Department

Submitted for VIVA VOCE on

Examiners

1.

2.
 ACKNOWLEDGEMENT

I am deeply indebted to my project guide Mrs. R. ROHINI M.Sc., M.Phil.,

Assistant professor of Mathematics, Government Arts College for Women
(Autonomous), Pudukkottai, who devoted most of her valuable time by
directing me in the preparation of this dissertation successfully.

I bow to convert my grateful thanks to Mrs. R. ROHINI M.Sc., M.Phil.,

Head and Assistant Professor of Mathematics, Government Arts College for
Women (Autonomous), Pudukkottai, for encouraging and aiding us.

I thank our Principal Dr. B. BUVANESWARI M.com., MBA., M.Phil.,

Ph.D., Government Arts College for Women (Autonomous), Pudukkottai,
for providing me with adequate facilities for carrying out this dissertation.

I remain intellectually indebted to all the Staff Members of the Department of

Mathematics, Government Arts College for Women (Autonomous),
Pudukkottai, for their full co-operation in various stage for this study.

M. ABINAYA
 INDEX

CHAPTER CONTENT PAGE

NO

INTRODUCTION 1

Ⅰ PRELIMINARIES 2

RESULTS FOR SILICATE, CHAIN SILICATE,

Ⅱ RHOMBUS SILICATE AND TRIANGULAR 11
SILICATE NETWORKS

RESULTS FOR HEXAGONAL, OXIDE,

Ⅲ RHOMBUS OXIDE AND HONEYCOMB 21
NETWORKS

CONCLUSION 31

BIBLIOGRAPHY 32
 INTRODUCTION

Graphs can be used to model many types of relations and process in

physical, biological, social, and information systems. Many practical problems can be
represented by graph emphasizing their application to real world systems. The term network
is sometimes defined to mean a graph in which attributes (e.g. Name) are associated
with the nodes/edges.

Graph theory also to study molecules in physics and chemistry. In chemistry, a

graph makes a natural model for a molecule where vertices represents atoms and edges
represents bonds. In chemistry, topological indices have found to be useful in chemical
documentation, isomer discrimination, structure property relationships, structure activity
relationship and pharmaceutical drug design.

In this project, we determine the square reverse index and its polynomial in
certain networks of chemical importance like silicate, chain silicate, rhombus silicate,
triangular silicate, hexagonal, oxide, rhombus oxide and honeycomb networks.

This dissertation consider of three chapter,

In chapter-Ⅰ, some basic definitions of graphs are studied.

In chapter-Ⅱ, results for silicate, chain silicate, rhombus silicate and triangular
silicate networks are studied.

In chapter-Ⅲ, results for hexagonal, oxide, rhombus oxide and honeycomb

networks are studied.

Finally it ends with conclusion and bibliography.

1
 PRELIMINARIES

1.1 Graph
A graph G consists of a pair (V(G),E(G)) where V(G) is a non-empty finite set
whose elements are called points or vertices and E(G) is the set of unordered pair of distinct
element of V(G). The elements of E(G) are called lines or edges of a graph G.
Example:

Graph with five vertices and seven edges.

G = {V(G), E(G)}

V(G) = {v1, v2, v3, v4, v5}, E(G) = {e1, e2, e3, e4, e5, e6, e7}

1.2 Simple graph

A graph that has neither self loop nor parallel edges are called a simple graph.

Example:

1.3 Finite graph

A graph with a finite number of vertices as well as finite number of edges is
called finite graph.

Otherwise it is an infinite graph.

Example:
 Finite graph G

Infinite graph H

1.4 Labelled graph

A graph in which each vertex is assigned a unique name or label (i.e., no two
vertices have the same label) is called a labelled graph.

The distinction between the labelled and an unlabelled graph is very

important when we are counting the number of different graphs.

Example:
1.5 Connected graph
A graph G is said to be a connected if there is at least one path between every
pair of vertices in G.

Otherwise G is disconnected graph.

Example:
Connected graph:

Disconnected graph with two component:

1.6 Incident
 When a vertex vi is an end vertex of some edge ej and vi and ej are said to be
incident with each other.

Example:

1.7 Adjacent
Two non-parallel edges are said to be adjacent if they are incident on a common
vertex. Two vertices are said to be adjacent if they are the vertices of the same edge.

Example:

1.8 Regular graph

A graph in which is all vertices of equal degree is called a regular graph.

Example:
1.9 Complete graph
A simple graph in which there exists an edge between every pair of vertices is
called a complete graph.

Example:

1.10 Bipartite graph

A bipartite graph whose vertices can be divided into two disjoint sets U and V
such that every edge connects a vertex in U to one in V.

Example:

1.11 Sub graph

 A graph g is said to be sub graph of a graph G if all vertices and all the edges of
g are in G and each edges of g has no same end vertices in g as in G.

Example:

Graph G Sub graph g

1.12 Degree
The number of edges incident at a vertex vi with self loop counted twice is
called the degree d(vi) of vertex vi.

Example:

From figure, d(v¿ ¿1)=2 , d ( v 2 ) =4 , d ( v3 ) =1 , d ( v 4 ) =4 , d ( v 5 )=3∧d ( v 6 ) =2.¿

The degree of vertex is sometimes also referred to as its valency.

1.13 Directed graph

 A directed graph is a graph, i.e., a set of objects (called vertices or nodes) that
are connected together, where all the edges are directed from one vertex to another.

A directed graph is sometimes called a digraph or a directed network.

Example:

Directed graph with five vertices and ten edges.

1.14 Undirected graph

An undirected graph is a graph, i.e., a set of objects (called vertices or nodes)
that are connected together, where all the edges are bidirectional. An undirected graph is
sometimes called an undirected network.

Example:

1.15 Topological indices

 In the field of chemical graph theory molecular topology and mathematical
chemistry, a topological index also known as a connectivity index is a type of a molecular
descriptor that is calculated based on the molecular graph of a chemical compound.

1.16 Molecular graph

A molecular graph is an undirected labelled graph G = (V, E) encoding the
structure and functional information of the molecule.

The set of vertices V of G encodes atoms and the set of edges E encodes the
adjacency relationship between atoms in the molecule.

Example:

1.17 Atoms
Atoms are defined as the smallest units of matter that have the properties of an
individual element. Atoms are made up of smaller and even smaller particles of matter.
However, those smaller particles don’t have the properties of an element.

1.18 Bonds
A chemical bond is a lasting attraction between atoms, ions or molecules that
enables the formation of chemical compounds.

The bond may result from the electrostatic force of attraction between
oppositely charged ions as in ionic bonds or through the sharing of electrons as in covalent
bonds.

1.19 Regular polygon

 A polygon is called regular if all sides are equal and all angles are equal.

Example:

1.20 Reverse vertex degree

Let G = (V,E) be a finite simple connected graph. The degree d G(V) of a vertex
V is the number of vertices adjacent to V. Let ∆(G) denote the largest of all degrees of G. The
reverse vertex degree of a vertex V in G is defined as c v = ∆(G)− dG(V)+1. The reverse edge
connecting the reverse vertices u and v will be denoted by uv.

1.21 Square ve-degree index

The square ve-degree index of a graph G is defined as

Qve (G) = ∑ [d ve ( u ) −d ve ( v ) ]2.

uv ∈ E (G )

1.22 Square reverse index

The square reverse index of a molecular graph G is defined as

QC (G) = ∑ (c u ¿−c v )¿2.

uv ∈ E (G )

1.23 Square reverse polynomial

Considering the square reverse index, the square reverse polynomial of a graph
G is defined as

∑
2

QC (G, x) = x (c −c ) .
u v

uv ∈ E (G )

10
RESULTS FOR SILICATE, CHAIN SILICATE, RHOMBUS SILICATE
AND TRIANGULAR SILICATE NETWORKS

Results for silicate networks

Silicates are obtained by fusing metal oxide or metal carbonates with sand.
Essentially all the silicates contains sio4 tetrahedral. In chemistry, the corner vertices of sio 4
tetrahedron represent oxygen ions and the centre vertex represents the silicon ion. In graph
theory, we call the corner vertices as oxygen nodes and the centre vertex as silicon nodes. By
the different arrangement of the tetrahedron silicate, we can obtain different silicate
structures. Similarly, different silicate networks are constructed by different silicate structure.

A silicate network is symbolized by SL n, where n is the number of hexagons

between the boundary of SLn. A 2-dimensional silicate network is presented in the figure 1.

Figure-1: A 2-dimensional silicate network

Let G be the graph of a silicate network SL n. From figure 1, it is easy to see that the
vertices of SLn are either of degree 3 or 6.

Therefore ∆(G) = 6.

Clearly we have cu = ∆(G) − dG(u)+1

= 6−dG(u) + 1

cu = 7−dG(u).

The graph G has 15n2+3n vertices and 36n2 edges. In algebraic method, there are
three types of edges based degree of end vertices of each edge as follows:

E33 = {uv ∈ E(G)|dG(u) = dG(v) = 3}, |E33| = 6n.

11
 E36 = {uv ∈ E(G)|dG(u) = 3,dG(v) = 6}, |E36| = 18n2+6n.

E66 = {uv ∈ E(G)|dG(u) = dG(v) = 6}, |E66| = 18n2−12n.

Thus there are three types of reverse edges are given in table 1.

Cu,cv\uv∈E(G) (4,4) (4,1) (1,1)

Number of edges 6n 18n2+6n 18n2−12n

Table -1: reverse edge partition of SLn.

In the following theorem, we compute the square reverse index of SLn.

Theorem: 2.1
The square reverse index of a silicate network SLn is given by

QC(SLn) = 162n2+54n.

Proof:
From square reverse index equation and table 1, we get

QC(SLn) = ∑ [cu ¿−c v ]¿ 2

uv ∈ E (G )

= (4−4)26n+(4−1)2(18n2+6n)+(1−1)2(18n2−12n)

= (0)6n+(3)2(18n2+6n)+(0)(18n2−12n)

= 0+9(18n2+6n)+0

= 9(18n2+6n)

= 9(18n2)+9(6n)

QC(SLn) = 162n2+54n.

Hence proved.

In the following theorem, we compute the square reverse polynomial of SLn.

Theorem: 2.2
The square reverse polynomial of a silicate network SLn is given by

QC(SLn,x) = (18n2+6n) x 9+(18n2−6n) x 0.

12
Proof:
From square reverse polynomial equation and using table 1, we get

∑
2

QC(SLn, x) = x (c −c )
u v

uv ∈ E (G )

2 2 2
= 6n x(4 −4) +(18n2+6n) x(4 −1 ) +(18n2−12) x(1−1)
2 2 2
= 6n x(0) +(18n2+6n) x(3) +(18n2−12n) x(0)

= 6n x 0+(18n2+6n) x 9+(18n2−12n) x 0

= (18n2+6n) x 9+[6n+(18n2−12n)] x 0

QC(SLn, x) = (18n2+6n) x 9+(18n2−6n) x 0.

Hence proved.

Results for chain silicate networks

We now consider a family of chain silicate networks. This network is
symbolized by CSn and is obtained by arranging n≥2 tetrahedral linearly. The chain silicate
network is presented in the figure -2.

Figure -2: chain silicate network

Let G be the graph of a chain silicate network CS n with 3n+1 vertices and 6n
edges. From figure-2, it is easy to see that the vertices of CSn are either of degree 3 or 6.

Therefore ∆(G) = 6.

Thus cu = ∆(G)−dG(u)+1

= 6−dG(u)+1

cu = 7−dG(u).

In G, by algebraic method, there are three types of edges based on the degree
of each edge as follows:
 13

E33 = {uv∈E(G)|dG(u) = dG(v) = 3}, |E33| = n+4.

E36 = {uv∈E(G)|dG(u) = 3, dG(v) = 6}, |E36| = 4n−2.

E66 = {uv∈E(G)|dG(u) = dG(v) = 6}, |E66| = n−2.

Thus there are three types of reverse edges as given in the table 2.

cu,cv \ uv ∈ E (G) (4,4) (4,1) (1,1)

Number of edges n+4 4n−2 n−2

Table-2: Reverse edge partition of CSn.

In the following theorem, we determine the square reverse index of CSn.

Theorem: 2.3
The square reverse index of a chain silicate network CSn is given by

QC(CSn) = 36n−18.

Proof:
From square reverse index equation and using table 2, we get

QC(CSn) = ∑ [cu ¿−c v ]¿ 2

uv∈ E (G )

= (4−4)2(n+4)+(4−1)2(4n−2)+(1−1)2(n−2)

= 0(n+4)+(3)2(4n−2)+0(n−2)

= 0+9(4n−2)+0

= 9(4n−2)

= 9(4n)−9(2)

QC(CSn) = 36n−18.

Hence proved.

In the following theorem, we determine the square reverse polynomial of CSn.

Theorem: 2.4
The square reverse polynomial of a chain silicate network CSn is given by

QC(CSn, x) = (4n−2) x 9+(2n+2) x 0.

 14

Proof:
From square reverse polynomial equation and using table 2, we get

∑
2
(c u−c v )
QC(CSn, x) = x
uv ∈ E (G )

2 2 2
= (n+4) x(4 −4) +(4n−2) x(4 −1 ) +(n−2) x(1−1)
2 2 2
= (n+4) x(0) +(4n−2) x(3) +(n−2) x(0)

= (4n−2) x o+(n−2) x 9+(n+4) x 0

= (4n−2) x 9+[n−2+n+4] x 0

QC(CSn, x) = (4n−2) x 9+(2n+2) x 0.

Hence proved.

Results for rhombus silicate network

We now consider a rhombus silicate network. This network is symbolized by
RHSLn and the rhombus silicate network of dimension 3 is presented in the figure-3.

Figure -3: a 3-dimension rhombus silicate network.

Let G be the graph of rhombus silicate network. From figure-3, it is easy to

see that the vertices of RHSLn are either of degree 3 or 6.

Therefore ∆(G) = 6.
 15

Clearly, we have cu = ∆(G)−dG(u)+1

= 6−dG(u)+1

cu = 7−dG(u).

The graph G has 5n2+2n vertices and 12n2 edges.

In G, by algebraic method, there are three types of edges based on the degree of end
vertices of each as follows:

E33 = {uv∈E(G)|dG(u) = dG(v) = 3}, |E33| = 4n+2.

E36 = {uv∈E(G)|dG(u) = 3,dG(v) = 6}, |E36| = 6n2+4n−4.

E66 = {uv∈E(G)|dG(u) = dG(v) = 6}, |E66| = 6n2−8n+2.

Thus there are three types of reverse edges as given in table 3.

Cu,cv\uv∈E(G) (4,4) (4,1) (1,1)

Number of edges 4n+2 6n2+4n−4 6n2−8n+2

Table-3: Reverse edge partition of RHSLn.

In the following theorem, we determine the square reverse index of RHSLn.

Theorem: 2.5
The square reverse index of a silicate network RHSLn is given by

QC(RHSLn) = 54n2+36n−36.

Proof:
From square reverse index and using table 3, we get

QC(RHSLn) = ∑ [cu ¿−c v ]¿ 2

uv ∈ E (G )

= (4−4)2(4n+2)+(4−1)2(6n2+4n−4)+(1−1)2(6n2−8n+2)

= (0)2(4n+2)+(3)2(6n2+4n−4)+(0)2(6n2−8n+2)

= 0+9(6n2+4n−4)+0

= 9(6n2)+9(4n)−9(4)

QC(RHSLn) = 54n2+36n−36.

Hence proved.
 16

In the following theorem, we compute the square reverse polynomial of RHSLn.

Theorem: 2.6
The square reverse polynomial of a silicate network RHSLn is given by

QC(RHSLn, x) = (6n2+4n−4) x 9+(6n2−4n+4) x 0.

Proof:
From square reverse polynomial and using table 3, we get

∑
2

QC(RHSLn, x) = x (c −c )
u v

uv ∈ E (G )

2 2 2
= (4n+2) x(4 −4) +(6n2+4n−4) x(4 −1 ) +(6n2−8n+2) x(1−1)
2 2 2
= (4n+2) x(0) +(6n2+4n−4) x(3) +(6n2−8n+2) x(0)

= (4n+2) x 0+(6n2+4n−4) x 9+(6n2−8n+2) x 0

QC(RHSLn, x) = (6n2+4n−4) x 9+(6n2−4n+4) x 0.

Hence proved.

Results for triangular silicate network

We now consider a family of triangular silicate network. A triangular silicate
network of dimension n is denoted by TSL n. A 4-dimensional triangular silicate network is
shown in the figure.

Figure -4: A 4-dimensional triangular silicate network.

 17

Let G be the graph of a triangular silicate network TSLn. From figure-4, it is easy to
see that the vertices of TSLn are either of degree 3,7 or 12.

Therefore ∆(G) = 12.

Clearly we have cu = ∆(G)−dG(u)+1

= 12−dG(u)+1

cu = 13−dG(u).

3
The graph G has ( ( n−1 ) ( n−2 )|2 ) 3( n−1)+n2 +3 vertices and n(n+1) edges.
2

In G, by algebraic method, there are six types of edges based on the degree of end
vertices of each edge as follows:

E33 = {uv ∈ E(G) |dG(u) = dG(v) = 3}, |E33| = 3.

E37 = {uv ∈ E(G) |dG(u) = 3, dG(v) = 7}, |E37| = 33+9(n−4).

E77 = {uv ∈ E(G) |dG(u) = dG(v) = 7}, |E77| = 3(n−1).

6 ( n−2 )(n−1)
E3 12 = {uv ∈ E(G) |dG(u) = 3, dG(v) = 12}, |E3 12| = .
2

E7 12 = {uv ∈ E(G) |dG(u) = 7, dG(v) = 12}, |E7 12| = 12+6(n−4).

3 ( n−3 ) (n−2)
E12 12 = {uv ∈ E(G) |dG(u) = 12, dG(v) = 12}, |E12 12| = .
2

Thus there are six types of reverse edges as shown in table 4.

cu,cv\ (10,10) (10, 6) (6, 6) (10, 1) (6, 1) (1, 1)

uv∈E(G
)
Number 3 33+9(n−4) 3(n−1) 6 ( n−1 ) ( n−2) 12+6(n−4) 3 ( n−3 ) (n−2)
of edges 2 2

Table -4: Reverse edge partition of TSLn.

In the following theorem, we compute the square reverse index of TSLn.

Theorem: 2.7
The square reverse index of a triangular silicate network TSLn is given by
 QC(TSLn) = 243n2+285n−762.

18

Proof:
From square reverse index equation and using table 4, we get

QC(TSLn) = ∑ [cu −c v ]2
uv ∈ E (G )

= (10−10)2(3)+(10−6)2[33+9(n−4)]+(6−6)2[3(n−1)]+(10−1)2( 6 ( n−1 ) (n−2)|2 )

+(6−1)2[12+6(n−4)]+(1−1)2( 3 ( n−3 ) (n−2)|2 )

= (0)(3)+(4)2[33+9(n−4)]+(0)3(n−1)+(9)2( 6 ( n−1 ) (n−2)|2 ) +(5)2[12+6(n−4)] +(0)

( 3 ( n−2 ) (n−3)|2 )

= 0+(16)[33+9(n−4)]+0+(81)( 6 ( n−1 ) (n−2)|2 ) +(25)[12+6(n−4)]+0

= 16(33)+16(9)(n−4)+81(3)(n−1)(n−2)+25(12)+25(6)(n−4)

= 528+144(n−4)+243(n−1)(n−2)+300(n−4)

= 243(n−1)(n−2)+(n−4)[144+300]+528

= 243(n2−3n+2)+(n−4)(444)+528

= 243n2−729n+486+444n−1776+528

= 243n2 +285n+1014−1776

QC(TSLn) = 243n2+285n−762.

Hence proved.

In the following theorem, we compute the square reverse polynomial of TSLn.

Theorem: 2.8
The square reverse polynomial of a triangular silicate network is given by

3
QC(TSLn, x) = (n2−3n+6) x 0+3(n−1) x 16+6(n−2) x 25+3(n2−3n+2) x 81.
2

Proof:
From square reverse polynomial equation and using table 4, we get
 ∑
2

QC(TSLn, x) = x [c −c ]
u v

uv ∈ E (G )

2 2 2 6 ( n−1 ) ( n−2) (10−1)

2 2
= (3) x(10−10) +[33+9(n−4)] x(10−6) +[3(n−1)] x(6−6) + x +[12+6(n−4)] x(6−1) +
2
3 ( n−2 ) (n−3) (1−1) 2

x
2

19

2 2 2 2 2 3 ( n−2 ) ( n−3) (0 )
2

= 3 x(0) +[33+9(n−4)] x(4 ) +3(n−1) x(0) +3(n−1)(n−2) x(9) +[12+6(n−4)] x(5) + x

2

= 3 x 0+[33+9(n−4)] x 16+3(n−1) x 0+3(n−1)(n−2) x 81+[12+6(n−4)] x 25

3 ( n−2 ) ( n−3) 0
+ x
2

= [3+3(n−1)+( 3 (n2−5 n+6)|2 ) ] x 0+[33+9(n−4)] x 16+3(n−1)(n−2) x 81

+[12+6(n−4)] x 25

=( 6+ 6 n−6+3 n2−15 n+18|2 ) x 0+[33+9n−36)] x 16+[12+6n−24)] x 25

+3(n−1)(n−2) x 81

=( 3 n2 −9 n+18|2 ) x 0+[9n−3] x 16+[6n−12] x 25+(3n2−9n+6) x 81

3
QC(TSLn, x) = (n2−3n+6) x 0+3(n−1) x 16 +6(n−2) x 25+3(n2−3n+2) x 81.
2

Hence proved.
20
RESULTS FOR HEXAGONAL, OXIDE, RHOMBUS OXIDE AND
HONEYCOMB NETWORKS

Results for hexagonal networks

It is known that there exist three regular plane tilings with composition of some
kind of regular polygons such as triangular, hexagonal, and square. In geometry, the
triangular tiling or triangular tessellation is one of the three regular tilings of the Euclidean
plane. Because the internal angle of the equilateral triangle is 60 degree, 6 triangle at a point
occupy a full 360 degree.

Hexagonal network represents a host cyclotriveratrylene with halogenated

monocarbaborane anions and silicon carbide. Carbon nanotubes consists of shells of sp 2-
hybridized carbon atoms forming a hexagonal network, arranged helically within a tubular
motif. Triangular tiling is used in the construction of hexagonal networks.

This network is symbolized by HX n, where n is the number of vertices in each

side of hexagon. A hexagonal network of dimension six is shown in figure 5.

Figure-5: Hexagonal network of dimension six

Let G be the graph of a hexagonal network HXn. The graph G has 3n2−3n+1 vertices
and 9n2−15n+6 edges.

From figure 5, it is easy to see that the vertices of HXn are either of degree 3, 4, or 6.

21
 Therefore ∆(G) = 6 and δ(G) = 3.

Thus cu = ∆(G)−dG(u)+1

= 6−dG(u)+1

cu = 7−dG(u).

In G, by algebraic method, there are five types of edges based on the degree of
end vertices of each edges as follows:

E34 = {uv∈E(G)|dG(u) = 3,dG(v) = 4}, |E34| = 12.

E36 = {uv∈E(G)|dG(u) = 3,dG(v) = 6}, |E36| = 6.

E44 = {uv∈E(G)|dG(u) = dG(v) = 4}, |E44| = 6n−18.

E46 = {uv∈E(G)|dG(u) = 4,dG(v) = 6}, |E46| = 12n−24.

E66 = {uv∈E(G)|dG(u) = dG(v) = 6}, |E66| = 9n2−33n+30.

Thus there are five types of reverse edges as given in table 5.

Cu,cv\uv∈ (4,3) (4,1) (3,3) (3,1) (1,1)

E(G)
Number of 12 6 6n−18 12n−24 9n2−33n+30
edges

Table -5: Reverse edge partition of HXn.

In the following theorem,we determine the square reverse index of HXn.

Theorem: 3.1
The square reverse index of a hexagonal network HXn is

QC(HXn) = 48n−30.

Proof:
From square reverse index and using table 5, we get

QC(HXn) = ∑ [cu ¿−c v ]¿ 2

uv∈ E (G )

= (4−3)212+(4−1)26+(3−3)2(6n−18)+(3−1)2(12n−24)+(1−1)2(9n2−33n+30)

= (1)212+(3)26+(0)(6n−18)+(2)2(12n−24)+(0)(9n2−33n+30)

22
 = 1×12+9×6+0+4(12n−24)+0

= 12+54+48n−96

= 48n−96+66

QC(HXn) = 48n−30.

Hence proved.

In the following theorem, we calculate the square reverse polynomial of HXn.

Theorem :3.2
The square reverse polynomial of a hexagonal network HXn.

QC(HXn, x) = 6 x 9+(12n−24) x 4+12 x 1+(9n2−27n+12) x 0.

Proof:
From square reverse polynomial equation and using table 5, we get

∑
2
(c u−c v )
QC(HXn, x) = x
uv∈ E (G )

2 2 2 2 2
= 12 x(4 −3 ) +6 x(4 −1 ) +(6n−18) x(3−3) +(12n−24) x(3−1) +(9n2−33n+30) x(1−1)
2 2 2 2 2
= 12 x(1) +6 x(3) +(6n−18) x(0) +(12n−24) x(2) +(9n2−33n+30) x(0)

= 12 x 1+6 x 9+(6n−18) x 0+(12n−24) x 4 +(9n2−33n+30) x 0

= 6 x 9+(12n−24) x 4 +12 x 1+[(6n−18)+(9n2−33n+30)] x 0

= 6 x 9+(12n−24) x 4 +12 x 1+[6n−18+9n2−33n+30] x 0

QC(HXn, x) = 6 x 9+(12n−24) x 4 +12 x 1+(9n2−27n+12) x 0.

Hence proved.

Results for oxide networks

The oxide networks are of vital importance in the study of silicate neworks.
When all the silicon nodes are deleted from a silicate network we obtain a new network
which is called an oxide network.

An oxide network of dimension n is denoted by OX n. A 5-dimensional oxide

network is shown in the figure.

23
 Figure -6: Oxide network of dimension 5.

Let G be the graph of an oxide network OX n. From figure 6,it is easy to see that the
vertices of OXn are either of degree 2 or 4.

Therefore ∆(G) = 4.

Thus cu = ∆(G)−dG(u)+1

= 4−dG(u)+1

cu = 5−dG(u).

By calculation, we obtain that G has 9n2+3n vertices and 18n2 edges.

In G, by algebraic method there are two types of edges based on the degree of end
vertices of each edge as follows:

E24 = {uv∈E(G)|dG(u) = 2,dG(v) = 4}, |E24| = 12n.

E44 = {uv∈E(G)|dG(u) = dG(v) = 4}, |E44| = 18n2−12n.

Thus there are two types of reverse edges as given in table 6.

Cu,cv\uv∈E(G) (3,1) (1,1)

Number of edges 12n 18n2−12n

Table -6: Reverse edge partition of OXn.

24

In the following theorem, we calculate the square reverse index of OXn.

Theorem: 3.3
The square reverse index of an oxide network OXn is given by

QC(OXn) = 48n.

Proof:
From square reverse index equation and using table 6, we get

QC(OXn) = ∑ [cu ¿−c v ]¿ 2

uv ∈ E (G )

= (3−1)212n+(1−1)2(18n2−12n)

= (2)212n+(0)(18n2−12n)

= (4)12n+0

QC(OXn) = 48n.

Hence proved.

In the following theorem, we calculate the square reverse polynomial of OXn.

Theorem: 3.4
The square reverse polynomial of an oxide network OXn is given by

QC(OXn, x) = 12n x 4 +(18n2−12n) x 0.

Proof:
From square reverse polynomial equation and using table 6, we get

∑
2

QC(OXn, x) = x (c −c )
u v

uv∈ E (G )

2 2
= 12n x(3−1) +(18n2−12n) x(1−1)
2 2
= 12n x(2) +(18n2−12n) x(0)

= 12n x 4 +(18n2−12n) x 0

QC(OXn, x) = 12n x 4+(18n2−12n) x 0.

Hence proved.

25
Results for rhombus oxide network
We consider a family of rhombus oxide network. A rhombus oxide network
of dimension n is denoted by RHOXn. A rhombus oxide network of dimension 3 is shown in
the figure 7.

Figure 7: A rhombus oxide network

Let G be the graph of rhombus oxide network RHOX n. From figure 7, it is easy to
see that the vertices of RHOXn are either of degree 2 or 4.

Therefore ∆(G) = 4.

Clearly we have cu = ∆(G)−dG(u)+1

= 4−dG(u)+1

cu = 5−dG(u).

The graph G has 3n2+2n vertices and 6n2 edges.

In G, by algebraic method, there are three types of edges based on the degree of end
vertices of each edge as follows:

E22 = {uv ∈ E(G) | dG(u) = dG(v) = 2}, |E22| = 2.

E24 = {uv ∈ E(G) | dG(u) = 2, dG(v) =4}, |E24| = 8n−4.

E44 = {uv ∈ E(G) | dG(u) = dG(v) = 4}, |E44| = 6n2−8n+2.

Thus there are three types of reverse edges are given in the table.

26
cu, cv \uv ∈ E(G) (3, 3) (3, 1) (1, 1)
Number of edges 2 8n−¿ 4 6n2−8n+2

Table 7: reverse edge partition of RHOXn.

In the following theorem, we compute the square reverse index of RHOXn.

Theorem: 3.5
The square reverse index of a rhombus oxide network RHOXn is given by

QC(RHOXn) = 32n−16.

Proof:
From square index equation and using table 7, we get

QC(RHOXn) = ∑ [cu −c v ]2
uv∈ E (G )

= (3−3)2(2)+(3−1)2(8n−4)+(1−1)2(6n2−8n+2)

= (0)(2)+(2)2(8n−4)+(0)(6n2−8n+2)

= 0+(4)(8n−4)+0

= 4(8n)−4(4)

QC(RHOXn) = 32n−16.

Hence proved.

In the following theorem, we compute the square reverse polynomial of RHOXn.

Theorem: 3.6
The square reverse polynomial of rhombus oxide network RHOXn is given by

QC(RHOXn, x) = (8n−4)x4+(6n2−8n+4)x0.

Proof:
From square reverse polynomial equation and using table 7, we get

∑
2

QC(RHOXn, x) = uv ∈ E (G ) x [c −c ]
u v

2 2 2
= (2) x [3−3] + ¿(8n−4) x [3−1] +(6n2−8n+2) x [1−1]
 27
2 2 2
= (2) x(0) +(8n−4) x(2) +(6n2−8n+2) x(0)

= 2x0+(8n−4)x4+(6n2−8n+2)x0

= x0(6n2−8n+2+2)+(8n−4)x4

QC(RHOXn, x) = (8n−4)x4+(6n2−8n+4)

Hence proved.

Results for honeycomb networks

Built recursively using the hexagon tessellation, honeycomb networks are widely
used in computer graphics, cellular phone base stations, image processing, and in chemistry
as the representation of benzoid hydrocarbons.

A honeycomb network of dimension n is denoted by HC n, where n is the number

of hexagons between central and boundry hexagon. A 4-dimensional honeycomb network is
shown in the figure 8.

Figure -8 : A 4-dimensional honeycomb network

Let G be the graph of a honeycomb network HC n. From figure 8, it is easy to see that
the vertices of HCn are either of degree 2 or 3.

Thus ∆(G) = 3.

Therefore cu = ∆(G)−dG(u)+1

= 3−dG(u)+1
 28

cu = 4−dG(u).

By calculation, we obtain that G has 6n2 vertices and 9n2−3n edges.

In G, by algebraic method, there are three types of edges based on the degree of end
vertices of each edge as follows:

E22 = {uv∈E(G)|dG(u) = dG(v) = 2}, |E22| = 6.

E23 = {uv∈E(G)|dG(u) = 2, dG(v) = 3}, |E23| = 12n−12.

E33 = {uv∈E(G)|dG(u) = dG(v) = 3}, |E33| = 9n2−15n+6.

Thus there are three types of reverse edges as given in table 8.

Cu,cv\uv∈E(G) (2,2) (2,1) (1,1)

Number of edges 6 12n−12 9n2−15n+6

Table -8: Reverse edge partition of HCn.

In the following theorem, we derive the square reverse index of HCn.

Theorem: 3.7
The square reverse index of a honeycomb network HCn is

QC(HCn) = 12n−12.

Proof:
From square reverse equation and using table 8, we get

QC(HCn) = ∑ [cu −c v ¿ ]¿2

uv ∈ E (G )

= (2−2)26+(2−1)2(12n−12)+(1−1)2(9n2−12n+6)

= (0)6+(1)2(12n−12)+(0)(9n2−12n+6)

= 0+12n−12+0

QC(HCn) = 12n−12.

Hence proved.
 29

In the following theorem, we derive the square reverse polynomial of HCn.

Theorem :3.8
The square reverse polynomial of a honeycomb network HCn is given by

QC(HCn, x) = (12n−12) x 1+(9n2−15n+12) x 0.

Proof:
From square reverse polynomial equation and using table 8, we get

∑
2

QC(HCn, x) = x (c −c )
u v

uv ∈ E (G )

2 2 2
= 6 x(2−2) +(12n−12) x (2−1) +(9n2−15n+6) x(1−1)
2 2 2
= 6 x(0) +(12n−12) x(1) +(9n2−15n+6) x(0)

= 6 x 0+(12n−12) x 1+(9n2−15n+6) x 0

= (12n−12) x 1+(6+9n2−15n+6) x 0

QC(HCn, x) = (12n−12) x 1+(9n2−15n+12) x 0.

Hence proved.
30
 CONCLUSION

In this project, the explicit formulas for the reduced square reverse index and its
polynomial of silicate, chain silicate, rhombus silicate, triangular silicate, hexagonal, oxide,
rhombus oxide and honeycomb networks are computed. These expressions can correlate the
molecular structure of silicate, chain silicate, rhombus silicate, triangular silicate, hexagonal,
oxide, rhombus oxide and honeycomb networks to information about their physical network.

31
 BIBLIOGRAPHY

1. I. Gutman and O.E. Polansky, Mathematical concepts in organic chemistry, Springer,

Berlin, (1986).
2. V.R.Kulli, College Graph Theory, Vishwa International Publications, Gulbarga, India
(2012).
3. V.R.Kulli, On the square ve-degree index and its polynomial of certain oxide
networks, Journal of Global Research in Mathematical Archives, (2018).
4. V.R.Kulli, Computing F-reverse index and F-reverse polynomial of certain networks,
International Journal of Engineering Sciences and Research Technology, 7(8)
(2018)237-243.
5. S. Arumugam and S. Ramachandran, (2015), Invitation to graph theory, scitech
publications, Kolkata, India.
6. V.R.Kulli, Computation of some topological indices of certain networks, International
Journal of Mathematical Archive, 8(2)(2017) 99-106.

32