Search arXivSearch

arXiv · 2310.12814

On Spectrum of Neighbourhood Corona Product of Signed Graphs

Abstract

Given two signed graphs $Γ_1$ with nodes $\{u_1,u_2,\cdots,u_n\}$ and $Γ_2$, the neighbourhood corona, $Γ_1*Γ_2$ is the signed graph obtained by taking one copy of $Γ_1$ and $n_1$ copies of $Γ_2$, and joining every neighbour of the $i^{th}$ node with each nodes of the $i^{th}$ copy of $Γ_2$ by a new signed edge. In this paper we will determine the condition for $Γ_1*Γ_2$ to be balanced. We also determine the adjacency spectrum of $Γ_1*Γ_2$ for arbitrary $Γ_1$ and $Γ_2$, and Laplacian and signless Laplacian spectrum of $Γ_1*Γ_2$ for regular $Γ_1$ and arbitrary $Γ_2$, in terms of the corresponding spectrum of $Γ_1$ and $Γ_2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bishal Sonar, Satyam Guragain, Ravi Srivastava. 2023-10-19. On Spectrum of Neighbourhood Corona Product of Signed Graphs. https://doi.org/10.1007/978-981-97-6798-4_7

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