Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Spectra of the neighbourhood corona of two graphs (1209.5906v3)

Published 26 Sep 2012 in math.CO

Abstract: Given simple graphs $G_1$ and $G_2$, the neighbourhood corona of $G_1$ and $G_2$, denoted $G_1\star G_2$, is the graph obtained by taking one copy of $G_1$ and $|V(G_1)|$ copies of $G_2$, and joining the neighbours of the $i$th vertex of $G_1$ to every vertex in the $i$th copy of $G_2$. In this paper we determine the adjacency spectrum of $G_1 \star G_2$ for arbitrary $G_1$ and $G_2$, and the Laplacian spectrum and signless Laplacian spectrum of $G_1\star G_2$ for regular $G_1$ and arbitrary $G_2$, in terms of the corresponding spectrum of $G_1$ and $G_2$. The results on the adjacency and signless Laplacian spectra enable us to construct new pairs of adjacency cospectral and signless Laplacian cospectral graphs. As applications of the results on the Laplacian spectra, we give constructions of new families of expander graphs from known ones by using neighbourhood coronae.

Summary

We haven't generated a summary for this paper yet.