On Bond Incident Degree Indices of Chemical Graphs
Abeer M. Albalahi,
Akbar Ali,
Zhibin Du,
Akhlaq Ahmad Bhatti,
Tariq Alraqad,
Naveed Iqbal,
Amjad E. Hamza
Affiliations
Abeer M. Albalahi
Department of Mathematics, College of Science, University of Ha’il, Ha’il P.O. Box 2440, Saudi Arabia
Akbar Ali
Department of Mathematics, College of Science, University of Ha’il, Ha’il P.O. Box 2440, Saudi Arabia
Zhibin Du
School of Software, South China Normal University, Foshan 528225, China
Akhlaq Ahmad Bhatti
Department of Sciences and Humanities, National University of Computer and Emerging Sciences, Lahore Campus, B-Block, Faisal Town, Lahore 54770, Pakistan
Tariq Alraqad
Department of Mathematics, College of Science, University of Ha’il, Ha’il P.O. Box 2440, Saudi Arabia
Naveed Iqbal
Department of Mathematics, College of Science, University of Ha’il, Ha’il P.O. Box 2440, Saudi Arabia
Amjad E. Hamza
Department of Mathematics, College of Science, University of Ha’il, Ha’il P.O. Box 2440, Saudi Arabia
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.
