#### Date of Award

8-2011

#### Document Type

Thesis

#### Degree Name

Master of Science (MS)

#### College/School

College of Science and Mathematics

#### Department/Program

Mathematical Sciences

#### Abstract

The focus of this thesis is on new development of the Randic and Sum Connectivity Indices of certain molecular and symmetric trees representing acyclic alkanes, or aliphatic hydrocarbons. The Randic Connectivity Index is one of the most used molecular descriptors in Quantitative Structure-Property and Structure-Activity Relationship modeling because of the relation that the isomers have between their properties and their structure. The structure-boiling point relationship models of aliphatic alcohols have been studied using the Sum Connectivity Index and compared to the Randic Connectivity Index. A specific type of tree T_{n,a}, well-known in graph theory as a double star, was studied by Zhou and Trinajstic. In this thesis, T_{n,a} trees are investigated. The tree T_{n,2} which has the third smallest Sum Connectivity Index value among all the trees with n vertices is found to be interesting and thereby is further explored. Some alkane trees are symmetric, which is the concentration of this thesis. The symmetric double star trees are denoted by J_{n}· The tree J_{n} has n vertices and is built on the path P₂ with (n - 2)/2 leaves from each vertex of the path. The Randic and Sum Connectivity Index formulas of the symmetric tree ln are developed. Also, estimations of the Randic and Sum Connectivity Indices of J_{n} are given. Relationships and comparisons between the Randic and Sum Connectivity Indices are analyzed in respect to the tree J_{n}· The ratio and difference of the Randic and Sum Connectivity Indices are further discussed.

The thesis starts with the history of the indices of molecular trees in Chemistry and Biology (Chapter 1). Chapter 2 provides a list of observations of the properties of both connectivity indices of the related trees. The symmetric tree J_{n} is discussed in Chapter 3, in which formulas and properties of the Randic and Sum Connectivity Indices are given. The main results of the thesis are reported in Chapter 4, where the graphs which have the maximal or minimal Randic and Sum Connectivity values among all Tn,a graphs with n vertices are identified. The closeness of the two indices of T_{n,a} trees is also discussed. The paper concludes with a similar tree, denoted T_{n,a} x P_{m}, extended from the tree T_{n},a by replacing the middle path P_{2} with the path P_{m} (m >/ 2). The Randic and Sum Connectivity Index formulas are given for this tree (Chapter 5). This topic will be investigated more in future work.

#### File Format

#### Recommended Citation

Feiner, Jennifer L., "Randic and Sum Connectivity Indices of Certain Trees" (2011). *Theses, Dissertations and Culminating Projects*. 835.

https://digitalcommons.montclair.edu/etd/835