0% found this document useful (0 votes)
114 views

Thesis

The document discusses topological indices, which are numerical parameters that characterize the topology of graphs. It mentions that topological indices of molecular graphs can help study drug properties and the computation of modified Zagreb connection indices. It also discusses dendrimers, harmonic index, Hosoya polynomial, domination number, and explicitly defined polynomials. The literature review indicates that topological indices are useful for studying drug and medicine production properties, as well as the chemical and biological characteristics of compounds. The methodology section describes using sources like journals, books, and websites to collect data and solve problems that arise during research.

Uploaded by

ammarah sanwal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
114 views

Thesis

The document discusses topological indices, which are numerical parameters that characterize the topology of graphs. It mentions that topological indices of molecular graphs can help study drug properties and the computation of modified Zagreb connection indices. It also discusses dendrimers, harmonic index, Hosoya polynomial, domination number, and explicitly defined polynomials. The literature review indicates that topological indices are useful for studying drug and medicine production properties, as well as the chemical and biological characteristics of compounds. The methodology section describes using sources like journals, books, and websites to collect data and solve problems that arise during research.

Uploaded by

ammarah sanwal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Introduction:

 A graph is a combination of vertices 𝑉 and 𝐸 edges.


 Topological indices are numerical parameters of a graph .which characterize its topology and are
usually graph invariants.
 In chemical graph theory a molecular graph or chemical graph is a representation of the
structural formula of a chemical compound in terms of a graph theory.
 Drugs are chemical substances that some people take because of their pleasant effects.
 Pharmacology is the branch of medicine concerned with the used, effects and modes of action
of drugs.
 Dendrimers are repetitively branched molecules. Tree like structure.
 The M-Polynomial of a graph 𝐺 is defined as

𝑀(𝐺; 𝑥, 𝑦) = ∑ 𝑖𝑗. 𝑚𝑖𝑗 (𝐺)𝑥𝑖 𝑦𝑗

 The harmonic index of a graph is defined as the sum of the weights 2𝑑(𝑢) + 𝑑(𝑣) of all edges.
 The Hosoya Polynomial of a graph was introduced by H.Hosoya in 1988 as a counting
polynomial.
 The domination number of a graph is the minimum size of a dominating set of vertices in.
 Explicit polynomial is the mathematical algebraic expressions stated clearly and in detail.

Literature Review:
Topological indices of molecular graphs are helpful to study the properties of drug,
manufacturing the medicines and computation of Modified first Zagreb connection index. Denoted by
𝑍𝐶1∗ .The use of dendrimers applications and its three families also the degree-based topological indices
.The task of evaluating the pharmacology, chemical and biological characteristics. Computation of
Harmonic index and forgotten index of Jahangir Graph. Determination of Hosoya polynomial, M-
polynomial and its advantages. Also, the study of domination number in Jahangir graph. The
computation of several distance based TI’s and formulation of explicit polynomials. Future work is about
the topological indices and its applications.

Methodology:

To find out answers and reasons of questions arising in our research work, we apply different sources
and strategies so that we get satisfactory results. For this purpose, we read journals, books, thesis,
research papers and articles. The basic definitions will be taken from[1] and [3] .We use library, digital
libraries, visit related websites and attend seminars to collect data to help in our research work to solve
problems arising in our study, and also to give a new form the older results.
Bibliography:
[1] T.C. Quynh, “On pseudo semi-projective modules,” Turk. J. Math, pp.37 (1):27-36, 2013.

[3] D. S. Dummit, R. M. Foote, Abstract Algebra, John Wiley & Sons, Inc., 2004.

You might also like