Search arXivSearch

arXiv · 2603.14048

On the Seidel energy of uniform hypergraphs due to hyperedge and vertex deletion

Abstract

Let $\mathcal{S}(\mathcal{H})$ be the Seidel matrix of a hypergraph $\mathcal{H}$, and the Seidel energy is denoted by the sum of the absolute eigenvalues of $\mathcal{S}(\mathcal{H})$. In [G.~X.~Tian, Y.~Li and S.~Y.~Cui, The change of Seidel energy of tripartite Turán graph due to edge deletion, Linear Multilinear Algebra, 19 (2022), 4597-4614] and [Y.~Liu, X.~Chen, The change of Seidel energy of 5-partite Turán graph due to edge deletion, Discrete Applied Mathematics, 2024, 342, 104-123], the authors studied the change of Seidel energy of the Turán graph due to edge deletion. In this article, we analyze the Seidel spectrum of the complete $3$-uniform bipartite hypergraph $\mathcal{C}^3_{m,n}$ and show that it has exactly one negative Seidel eigenvalue even after a single hyperedge deletion. Finally, we prove that the Seidel energy of the complete $3$-uniform bipartite hypergraph $\mathcal{C}^3_{m,n}$ decreases after single hyperedge and vertex deletion for all $m,n \ge 3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shib Sankar Saha. 2026-03-14. On the Seidel energy of uniform hypergraphs due to hyperedge and vertex deletion. https://arxiv.org/abs/2603.14048

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO