کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8902818 | 1632393 | 2018 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Which cospectral graphs have same degree sequences
ترجمه فارسی عنوان
کدام نمودار گرافیکی دارای توالی درجه ای است
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
چکیده انگلیسی
Two graphs are said to be L-cospectral (respectively, Q-cospectral) if they have the same (respectively, signless) Laplacian spectra, and a graph G is said to be LâDS (respectively, QâDS) if there does not exist other non-isomorphic graph H such that H and G are L-cospectral (respectively, Q-cospectral). Let d1(G)â¥d2(G)â¥â¯â¥dn(G) be the degree sequence of a graph G with n vertices. In this paper, we prove that except for two exceptions (respectively, the graphs with d1(G)â{4,5}), if H is L-cospectral (respectively, Q-cospectral) with a connected graph G and d2(G)=2, then H has the same degree sequence as G. A spider graph is a unicyclic graph obtained by attaching some paths to a common vertex of the cycle. As an application of our result, we show that every spider graph and its complement graph are both LâDS, which extends the corresponding results of Haemers et al. (2008), Liu et al. (2011), Zhang et al. (2009) and Yu et al. (2014).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 341, Issue 11, November 2018, Pages 2969-2976
Journal: Discrete Mathematics - Volume 341, Issue 11, November 2018, Pages 2969-2976
نویسندگان
Muhuo Liu, Yuan Yuan, Lihua You, Zhibing Chen,