Theory and chemical applications of the ψk-index of graphs

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.

Authors

Institutions

Publication Details

Journal
ChemRxiv
Published
2026-11-16
DOI
https://doi.org/10.26434/chemrxiv.15012289/v1
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Theory and chemical applications of the ψk-index of graphs

Ammar Alsinai
ChemRxiv
Graph theory and applications
preprint

Theory and chemical applications of the ψk-index of graphs

Ammar Alsinai
preprint en

Abstract

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.

ChemRxiv
Qassim University (SA), Ibb University (YE)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon