Local energy and vertex deletion for -matrices
Ravinder Kumar, Piyush Sharma
Source abstract
We study the change in the trace norm and the centred energy of the -matrix of a graph under vertex deletion. A pinching argument proves that the trace norm is nondecreasing under passage from an induced subgraph to the original graph, and gives a lower bound in terms of the edges induced by the deleted vertices. Exact perturbation spectra yield sharp upper bounds for deleting a vertex or an independent set of vertices with a common neighbourhood. For , equality in these upper bounds is characterized by star and complete bipartite components, respectively. For the centred energy, we derive explicit deletion bounds and classify all connected equality graphs for : the extremal graphs are stars and complete bipartite graphs for single-vertex and independent-twin deletion, respectively. We also characterize equality in the general-set trace-norm lower bound and prove strictness of the total centred-energy inequality for connected nonregular graphs when . Examples show that centred local energy can be negative and that the degree deviation term cannot be omitted in general.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.