کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4654908 1632843 2006 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A sufficient condition for a family of graphs being determined by their generalized spectra
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
A sufficient condition for a family of graphs being determined by their generalized spectra
چکیده انگلیسی

A graph GG is said to be determined by its spectrum   (DS for short), if any graph having the same spectrum as GG is necessarily isomorphic to GG. One important topic in the theory of graph spectra is how to determine whether a graph is DS or not. The previous techniques used to prove a graph to be DS heavily rely on some special properties of the spectrum of the given graph. They cannot be applied to general graphs. In this paper, we propose a new method for determining whether a family of graphs (which have no special properties) are DS with respect to their generalized spectra. The method is obtained by employing some arithmetic properties of a certain matrix associated with a graph. Numerical examples are further given to illustrate the effectiveness of the proposed method.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 27, Issue 6, August 2006, Pages 826–840
نویسندگان
, ,