3 papers
math.CO2026
Extremal Mostar Index of Graphs with Given Number of Cut Edges
Sunilkumar M. Hosamani
The Mostar index of a connected graph \(G\) is defined as \[ Mo(G)=\sum_{uv\in E(G)}\bigl|n_u(uv)-n_v(uv)\bigr|, \] where for an edge \(e=uv\), \(n_u(e)\) denotes the number of ver…
math.CO2026
Topological Indices Over Nonzero Component Graph of a Finite Dimensional Vector Space
Sunilkumar M. Hosamani
The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dim…
math.CO2026
Maximum Inverse Sum Indeg Index of Trees and Unicyclic Graphs with Fixed Diameter
Sunilkumar M. Hosamani
The bond incident degree (BID) index of a graph \(G\) is defined as \(\BID(G) = \sum_{u_1u_2\in E(G)} f(d(u_1), d(u_2))\), where \(f(x,y)=f(y,x)\) is a real-valued function. In thi…