Browsing by Author "Shooshtari, Hajar"

Now showing 1 - 6 of 6

Certain Types of Minimum Covering Estrada Index of Graphs
(World Scientific Publ Co Pte Ltd, 2023) Shooshtari, Hajar; Atapour, Maryam; Cancan, Murat
Let G be a simple, finite, undirected graph with n vertices. The main purpose of this paper introduces the concepts of the minimum covering Gutman Estrada index, the minimum covering Seidel Estrada index, the minimum covering distance Estrada index, the minimum covering Randic Estrada index, the minimum covering Harary Estrada index, and the minimum covering color Estrada index of a graph. First, we compute the new concepts for some of the graphs, such as cocktail party, star, crown, complete and complete bipartite. Moreover, we establish upper and lower bounds for the new concepts.
Entropy Measures of Topological Indices Based Molecular Structure of Benzenoid Systems
(Taylor & Francis Ltd, 2024) Zuo, Xuewu; Shooshtari, Hajar; Cancan, Murat
Graph theory plays a significant role in the applications of chemistry, pharmacy, communication, maps, and aeronautical fields. A benzenoid is a class of chemical compounds with at least one benzene ring(hexagon as a graph) and resonance bonds in the benzene ring give increased stability in benzenoids. The molecules of chemical compounds are modeled as a graph to study the properties of the compounds. The geometric structure of the compound relates to a few physical properties such as boiling point, enthalpy, & pi;-electron energy, and molecular weight. Entropy is a thermodynamic function in physics that measures the randomness and disorder of molecules in a particular system or process based on the diversity of configurations that molecules might take. Degree-based entropy is used to address a wide range of problems in the domains of mathematics, biology, chemical graph theory, organic and inorganic chemistry, and other disciplines. This paper focusses on computing analytical expressions of degree-based entropy measures for benzenoid systems.
Extremum Sum-Connectivity Index of Trees and Unicyclic Graphs
(World Scientific Publ Co Pte Ltd, 2022) Shooshtari, Hajar; Motamedi, Ruhollah; Cancan, Murat
The sum-connectivity index of a graph G is defined as the sum of weights 1/root d(w) +d(z ) over all edges wz of G, where d(w) and d(z) are the degrees of the vertices w and z in G, respectively. In this paper, we provide a simpler method to the extremal trees and unicyclic graph of the sum-connectivity index.
New Bounds for Spectral Radius and the Geometric-Arithmetic Energy of Graphs
(Soc Paranaense Matematica, 2025) Shooshtari, Hajar; Cancan, Murat
In this paper, new bounds on the GA-energy of graphs are established. Moreover, we show the our bounds are stronger than some previously known lower and upper bounds in the literature.
Topological Indices Study of Molecular Structure Hyaluronic Acid-Paclitaxel Conjugates in Cancer Treatment
(Taylor & Francis Ltd, 2024) Zhuang, Jing; Shooshtari, Hajar; Cancan, Murat
A large number of medical experiments have confirmed that the features of drugs have a close correlation with their molecular structure. Drug properties can be obtained by studying the molecular structure of corresponding drugs. The calculation of the topological index of a drug structure enables scientists to have a better understanding of the physical chemistry and biological characteristics of drugs. In this paper, we obtain the exact formulas by virtue of the edge-partition method for mSO(alpha)(G) and KA((alpha, beta))(1)(G). By the appropriate choice of parameters alpha and beta, several new/old inequalities that reveal relationships between various topological indices are obtained. Our results remedy the lack of medicine experiments, thus providing a theoretical basis for pharmaceutical engineering.
Zagreb Energy of Some Classes of Graphs
(World Scientific Publ Co Pte Ltd, 2022) Shooshtari, Hajar; Hatefi, Hakimeh; Cancan, Murat
Let G be a graph with n vertices and di is the degree of its ith vertex (d(i) is the degree of v(i)), then the Zagreb matrix of G is the square matrix of order n whose (i,j)entry is equal to d(i) + d(j) if the ith and jth vertex of G are adjacent, and zero otherwise. The Zagreb energy ZE(G) of a graph G is defined as the sum of the absolute values of the eigenvalues of the Zagreb matrix. In this paper, we compute the Zagreb energy for some of the specific graphs, edge deleted graphs and complements graphs. Moreover, some properties of the eigenvalues and bounds for Zagreb energy are also discussed.