Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 31 min ago
PreprintarXiv licencearXiv

Local energy and vertex deletion for Aα-matrices

Abstract

We study the change in the trace norm and the centred energy of the Aα-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 0<α<1/2, 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 0≤α<1: 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 0<α<1. Examples show that centred local energy can be negative and that the degree deviation term cannot be omitted in general.

Related

  1. Two-point concentration for graph classes admitting sparse vertex deletion
    Margarita Akhmejanova, Vladislav Kozhevnikov
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  2. A Conditional, Boundary-Aware, and Auditable Deletion-Effect Weighting Framework for MCDM with Positive Decision Matrices and a Fixed Set of Alternatives
    Xudan Dong, Xiaoping Cui, Shuangchao Xu +1
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  3. Local Ore Conditions for Rainbow Pancyclicity and Vertex-Pancyclicity in Graph Systems
    Ailian Chen, Jiahuang Lin
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. A Vertex-Localized Positive Square-Energy Strengthening of Turán's Theorem
    Abhay Jayarajan, M. Rajesh Kannan, Shivaramakrishna Pragada +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. From Wheel to Jahangir graphs: spectra and energy under structured edge deletion
    Diego Bravo, Florencia Cubría, Annabella Zapattini
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{kumar2026local,
  title = {{Local energy and vertex deletion for $A_α$-matrices}},
  author = {Ravinder Kumar and Piyush Sharma},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.24517},
  eprint = {2610.24517},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.24517},
}
RIS
TY  - UNPB
TI  - Local energy and vertex deletion for A_α-matrices
AU  - Ravinder Kumar
AU  - Piyush Sharma
PY  - 2026
DA  - 2026/10/17
PB  - arXiv
DO  - 10.48550/arxiv.2610.24517
UR  - https://arxiv.org/abs/2610.24517
AB  - We study the change in the trace norm and the centred energy of the A_α-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 0<α<1/2, 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 0≤α<1: 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 0<α<1. Examples show that centred local energy can be negative and that the degree deviation term cannot be omitted in general.
ER  -