Search arXivSearch

arXiv · 2603.19590

Vertex energies of splitting and shadow graphs

Abstract

Graph energy has been widely investigated in spectral graph theory. However, the manner in which this energy is distributed among individual vertices has received attention only more recently, following the introduction of energy of a vertex by O. Arizmendi et al. in 2018. Since then, several studies have explored this concept. In the present work, we focus on splitting graphs and shadow graphs and study how the total energy of a graph is distributed among its vertices. We further establish explicit expressions for vertex energies in these derived structures and analyze their behavior in comparison with the underlying graph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harshitha A, Madhumitha K V, Sabitha D'Souza. 2026-03-20. Vertex energies of splitting and shadow graphs. https://arxiv.org/abs/2603.19590

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