← All problems

The edge-deletion energy conjecture for degree-based weighted adjacency matrices

Let KnK_n be the complete graph, let ee be an edge of KnK_n, and let A˙(Kn)\boldsymbol{\dot{A}}(K_n) and A˙(Kn−e)\boldsymbol{\dot{A}}(K_n-e) denote the degree-based weighted adjacency matrices whose edge weights are determined by a function ϕ(x,y)\phi(x,y) 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 A˙(Kn)\dot{A}(K_n) is strictly greater than the energy of A˙(Kn−e)\dot{A}(K_n-e) for almost all functions ϕ(x,y)\phi(x,y). 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
  1. Bilal Ahmad Rather and Hilal Ahmad Ganie, “Degree-Based Weighted Adjacency Matrices: Spectra, Integrality, and Edge Deletion Effects”, arXiv:2603.08895 (2026).

Progress summary

Never refreshed

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.