Searcharxiv⌕ Search

arXiv · 2610.24517

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\leα<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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ravinder Kumar, Piyush Sharma. 2026-10-17. Local energy and vertex deletion for $A_α$-matrices. https://arxiv.org/abs/2610.24517

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Two Erdos-Hajnal-type theorems for forbidden order-size pairs

The celebrated Erdős-Hajnal conjecture says that any graph without a fixed induced subgraph $H$ contains a very large homogeneous set. A direct analog of this conjecture is not true for hypergraphs. In this paper we present two natural variants of this problem which do hold for hypergraphs. We show that for every $r \geq 3$, $m \geq m_0(r)$ and $0 \leq f \leq \binom{m}{r}$, if an $r$-graph $G$ does not contain $m$ vertices spanning exactly $f$ edges, then $G$ contains much larger homogeneous sets than what is guaranteed to exist in general $r$-graphs. We also prove that if a $3$-graph $G$ does not contain homogeneous sets of polynomial size, then for every $m \geq 3$ there are $Ω(m^3)$ values of $f$ such that $G$ contains $m$ vertices spanning exactly $f$ edges. This makes progress on a problem of Axenovich, Bradač, Gishboliner, Mubayi and Weber.

math.CO↗

Unexpectedly, a symmetry on unlabeled graphs

We exhibit the joint symmetric distribution of the following two parameters on the set of unlabeled, simple, connected graphs with $n$ vertices. The first parameter is the maximal number of leaves attached to a vertex. The second parameter is the size of the largest set of vertices sharing the same closed neighborhood minus $1$. Apparently, this is the first example of a natural, non-trivial equidistribution of graph parameters on unlabeled connected graphs on a fixed set of vertices. Our proof is enumerative, using the theory of species. Exhibiting an explicit bijection interchanging the two parameters remains an open problem.

math.CO↗

Cycle lengths in the percolated hypercube

Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$ such that, if $pd\ge c$, then typically $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. We strengthen this result to show that, under the same assumptions, typically $Q^d_p$ contains cycles of all even lengths between $4$ and $(1-\varepsilon)2^d$.

math.CO↗