Bell Graphs are Determined by their Laplacian Spectra
Kragujevac Journal of Mathematics, Tome 47 (2023) no. 2, p. 203
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
A graph $G$ is said to be determined by the spectrum of its Laplacian spectrum (DLS, for short) if every graph with the same spectrum is isomorphic to $G$. An $\infty$-graph is a graph consisting of two cycles with just a vertex in common. Consider the coalescence of an $\infty$-graph and the star graph $K_{1,s}$, with respect to their unique maximum degree. We call this a bell graph. In this paper, we aim to prove that all bell graphs are DLS.
Classification :
05C50
Keywords: Bell graph, Laplacian spectrum, $L$-cospectral, cospectral graphs, spectral characterization
Keywords: Bell graph, Laplacian spectrum, $L$-cospectral, cospectral graphs, spectral characterization
@article{KJM_2023_47_2_a2,
author = {Ali Zeydi Abdian},
title = {Bell {Graphs} are {Determined} by their {Laplacian} {Spectra}},
journal = {Kragujevac Journal of Mathematics},
pages = {203 },
year = {2023},
volume = {47},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KJM_2023_47_2_a2/}
}
Ali Zeydi Abdian. Bell Graphs are Determined by their Laplacian Spectra. Kragujevac Journal of Mathematics, Tome 47 (2023) no. 2, p. 203 . http://geodesic.mathdoc.fr/item/KJM_2023_47_2_a2/