Open access
Jul 2026
Path Energy Bounds For Hub-Centric Graphs Of Order 2n+1 With Algorithmic Computation
An explicit spectral construction is developed enabling the numerical validation algorithm to evaluate the time complexity in various structural configurations of (2n+1)-graphs, highlighting the substantial algorithmic demands for several graphs.
R. Jerlinkasmir, J. Veninstine Vivik, I. N. Cangul et al.
· Scientific Annals of Compute... · 0 citations