Search arXivSearch

arXiv · 2512.04836

Distribution of deformed Laplacian limit points

Abstract

This paper investigates limit points of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a quadractic one-parameter family of matrices. First, we show that any value greater or equal to 1 is a deformed Laplacian limit point (for different values of the parameter $s$) using a simple family of trees. Second, we define $(T_k)_{k \in \mathbb{N}}$ the Shearer's sequence of caterpillars for $λ>1$ and we present a convergence criterion based on Shearer's approach. Our main result is that for any fixed value $λ_0>1$ there exists a unique value $0<s^* <\sqrt{λ_0} -1$ such that, and for any $s \in (0,s^*)$ the interval $[λ_0, \; +\infty)$ is entirely formed by $s$-deformed Laplacian limit points (for the same value of $s$). Finally, we provide some numerical data exploring the limit properties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elismar R. Oliveira, Jonas Szutkoski, VIlmar Trevisan. 2025-12-04. Distribution of deformed Laplacian limit points. https://arxiv.org/abs/2512.04836

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