Search arXivSearch

arXiv · 2512.19404

On Spectral Properties of Lanzhou Matrix of Graphs

Abstract

Let $Γ$ be a simple graph on $n$ vertices. Lanzhou index is defined as $Lz(Γ)=\sum\limits_{u \in V(Γ)}d_Γ(u)^2d_{\overlineΓ}(u).$ In this manuscript, the Lanzhou matrix, denoted by $A_{Lz}(Γ)$, has been defined, and its spectral properties are studied. The $uv^{th}$ entry in $A_{Lz}(Γ)$ is $d_Γ(u)d_{\overlineΓ}(u)+d_Γ(v)d_{\overlineΓ}(v)$ if $u$ and $v$ are adjacent. Otherwise, the entry is zero. Some bounds on Lanzhou energy and spread on the Lanzhou matrix are obtained. Also, Lanzhou eigenvalues and inertia for some standard graphs have been obtained. Additionally, characterizations for the symmetricity of Lanzhou eigenvalues about the origin are obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Madhumitha K V, Harshitha A, Swati Nayak, Sabitha D'Souza. 2025-12-22. On Spectral Properties of Lanzhou Matrix of Graphs. https://arxiv.org/abs/2512.19404

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