The edge-deletion energy conjecture for degree-based weighted adjacency matrices
Let be the complete graph, let be an edge of , and let and denote the degree-based weighted adjacency matrices whose edge weights are determined by a function of the endpoint degrees. Their energies are the sums of the absolute values of their adjacency-matrix eigenvalues. Edge-deletion energy conjecture. The energy of is strictly greater than the energy of for almost all functions . This observation is based on computational experiments and numerical comparisons for several well-known degree-based weighted adjacency matrices; the phrase “almost all” is not further quantified in the source, so the precise scope of the claim remains open.
References
- Bilal Ahmad Rather and Hilal Ahmad Ganie, “Degree-Based Weighted Adjacency Matrices: Spectra, Integrality, and Edge Deletion Effects”, arXiv:2603.08895 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.