Akhlaq Ahmad Bhatti

Prof. Dr. Akhlaq Ahmad Bhatti


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 December 2019 in Journal of Taibah University for Science
Verified
Journal Article
Open access
SNSadia Noureen
Sadia Noureen
ABAkhlaq Ahmad Bhatti
Akhlaq Ahmad Bhatti
Akbar AliAkbar Ali
Akbar Ali
The modified first Zagreb connection index Z C 1 ∗ is a graph invariant, initially appeared within a formula of the total electron energy of alternant hydrocarbons in 1972, and revisted in a recent paper [A. Ali, N. Trinajstić. A novel/old modification of the first Zagreb index. Mol Inform. 2018;37(6). Art# 1800008; arXiv:1705.10430 [math.CO]]. In this paper, the graph(s) with the maximum/minimum Z C 1 ∗ value is/are characterized from the class of all n-vertex trees with fixed number of segments. As the number of segments in a tree can be determined from the number of vertices of degree 2 (and vice versa), the trees with the extremum Z C 1 ∗ values are also determined from the class of all n-vertex trees having a fixed number of vertices of degree 2.

13 May 2024 in Heliyon
Verified
Journal Article
Open access
SNSadia Noureen
Sadia Noureen
Akbar AliAkbar Ali
Akbar Ali
ABAkhlaq Ahmad Bhatti
Akhlaq Ahmad Bhatti
AAAbdulaziz M. ALANAZI
Abdulaziz M. ALANAZI
Yilun ShangYilun Shang
Yilun Shang
Many existing studies show that there exists a strong relationship between structures and characteristics of molecules. Topological indices are often used in modeling the properties of chemical compounds and biological activities in theoretical chemistry. Topological indices are numerical values associated with structures of molecules in such a way that they remain constant under graph isomorphism. Multiplicative Zagreb indices are among the famous topological indices that have been explored by numerous researchers in the last few years. The first objective of the present paper is to examine the importance of general multiplicative Zagreb indices for forecasting the enthalpy of formation of hydrocarbons using a data set of 25 benzenoid hydrocarbons. The second objective of this paper is to study molecular trees with a given order and with a given number of branching vertices or segments using general multiplicative (first and second) Zagreb indices. Sharp lower/upper bounds on these Zagreb indices for the aforementioned molecular trees are obtained and the graphs attaining these bounds are determined. Bounds on the classical multiplicative Zagreb and Narumi-Katayama indices are corollaries of the obtained results.

4 November 2022 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
Akbar AliAkbar Ali
Akbar Ali
AAAbeer M Albalahi
Abeer M Albalahi
AAAbdulaziz M. ALANAZI
Abdulaziz M. ALANAZI
ABAkhlaq Ahmad Bhatti
Akhlaq Ahmad Bhatti
AHAmjad E Hamza
Amjad E Hamza

20 April 2013 in International Journal of Theoretical Physics
Verified
Journal Article
Closed access
PDF file
MSM.Frasat Shammir
M.Frasat Shammir
AJAdil Jhangeer
Adil Jhangeer
ABAkhlaq Ahmad Bhatti
Akhlaq Ahmad Bhatti

15 July 2016 in International Journal of Applied and Computational Mathematics
Verified
Journal Article
Closed access
PDF file
Akbar AliAkbar Ali
Akbar Ali
ABAkhlaq Ahmad Bhatti
Akhlaq Ahmad Bhatti
ZRZahid Raza
Zahid Raza

21 December 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
AAAbeer M Albalahi
Abeer M Albalahi
Akbar AliAkbar Ali
Akbar Ali
Zhibin DuZhibin Du
Zhibin Du
ABAkhlaq Ahmad Bhatti
Akhlaq Ahmad Bhatti
TATariq Alraqad
Tariq Alraqad
AHAmjad E. Hamza
Amjad E. Hamza
By swapping out atoms for vertices and bonds for edges, a graph may be used to model any molecular structure. A graph G is considered to be a chemical graph in graph theory if no vertex of G has a degree of 5 or greater. The bond incident degree (BID) index for a chemical graph G is defined as the total of contributions f(dG(u),dG(v)) from all edges uv of G, where dG(w) stands for the degree of a vertex w of G, E(G) is the set of edges of G, and f is a real-valued symmetric function. This paper addresses the problem of finding graphs with extremum BID indices over the class of all chemical graphs of a fixed number of edges and vertices.