Answers are grounded in this paper and cite their sources.
For an integer k ≥ 1, the k-th distance degree d_k(v) of a vertex v is the number of vertices at distance exactly k from v. We introduce the ψk-index, Ψk(G) = Σuv∈E(G) (d_k(u)+1)(d_k(v)+1)/(d_k(u)+d_k(v)+2), a bond-additive descriptor that is defined for every graph, including graphs with vertices of zero k-distance degree, and that is generated from the ψk-polynomial by a single differential operator. For k = 1 it is the inverse sum indeg (ISI) index of closed neighbourhoods; its edge weight is stable under changes of the distance degrees, and Ψ2 separates trees that share the M-polynomial and all three leap Zagreb indices. We obtain closed formulas for 38 families of graphs, sharp bounds with characterisation of the extremal graphs, exact results for the join, Cartesian product, corona product and complement, and a study of the roots of the associated index polynomial. We compare the index with the leap Zagreb and reciprocal leap indices. On 22 benzenoid hydrocarbons Ψ1 and Ψ2 predict boiling points and total π-electron energies better than these indices, although molecular size alone does better still. On the 18 octane isomers, where size is constant, Ψ1 is the best of these indices for the acentric factor and entropy.
No takes yet. Share an insight, caveat, or question.
Ammar Alsinai (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: