Year: 2026
Type: article
Abstract: This paper introduces the minimum hop hub distance matrix of a connected graph and the associated graph energy, denoted E hd (G).The matrix is obtained from the distance matrix by placing the value 1 in every diagonal position indexed by a vertex of a prescribed minimum hop hub set, so that the new invariant couples the metric structure of the graph with the hop hub number h h (G).Exact closed forms of the characteristic polynomial, the spectrum and the energy are established for complete graphs, complete bipartite graphs K p,p and double stars S p,p , each derived by an explicit eigenvector decomposition rather than by inspection.Two coefficient identities that had been stated in terms of the size q are shown to depend instead on the second distanceequivalently on the Wiener and hyper-Wiener indices; corrected statements and proofs are supplied.A structural decomposition A H hd (G) = D(G) + diag(χ H ) is exploited to obtain Weyl-type eigenvalue interlacing with the distance matrix, the perturbation bound |E hd (G) -E D (G)| ≤ h h (G), bounds of McClelland and Koolen-Moulton type, and the sharp lower bound E hd (G) ≥ p for every connected graph of order p, with equality precisely for the complete graph.Since the energy depends on the choice of minimum hop hub set, the genuine invariants E - hd (G), E + hd (G) and the spread σ(G) = E + hd (G) -E - hd (G) are introduced and bounded by 2h h (G).All theoretical claims are supported by an exhaustive computational evaluation over 45 named graphs, 448 minimum hop hub sets and 2074 random connected graphs, reported through six tables and four figures.
Authors: Abdulkafi Sanad, Abaid Ullah, Abdulqawe Kaed
Institutions: Yunnan University, Thamar University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7203820166