Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question ''Which graphs are determined by their spectrum?'' remains a difficult problem in algebraic graph theory. In this article we enlarge the known families of graphs determined by their spectrum by considering some unicyclic graphs. An odd (resp. even) sun is a graph obtained by appending a pendant vertex to each vertex of an odd (resp. even) cycle. A broken sun is a graph obtained by deleting pendant vertices of a sun. In this paper we prove that a sun is determined by its Laplacian spectrum, an odd sun is determined by its adjacency spectrum (counter-examples are given for even suns) and we give some spectral characterizations of broken suns.

Source : oai:HAL:hal-00740240v1

Volume: Vol. 11 no. 2

Section: Graph and Algorithms

Published on: December 1, 2009

Submitted on: March 26, 2015

Keywords: Graphs,algebraic graph theory,spectral graph theory,unicyclic graphs,Laplacian matrix,adjacency matrix,graphs determined by their spectrum,sun graphs,[MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM]

This page has been seen 48 times.

This article's PDF has been downloaded 66 times.