Laplacian spectral characterization of roses
Sign Up to like & getrecommendations! Published in 2018 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2017.08.012
Abstract: A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a… read more here.
Keywords: laplacian spectral; characterization roses; spectral characterization;