کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4626369 | 1631786 | 2015 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The bipartite unicyclic graphs with the first ⌊n−34⌋ largest matching energies
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The theory of matching energy of graphs since been proposed by Gutman and Wagner in 2012, has attracted more and more attention. It is denoted by Bn,m,Bn,m, the class of bipartite graphs with order n and size m . In particular, Bn,nBn,n denotes the set of bipartite unicyclic graphs, which is an interesting class of graphs. In this paper, for odd n , we characterize the bipartite unicyclic graphs with the first ⌊n−34⌋ largest matching energies. There is an interesting correspondence: we conclude that the graph with the second maximal matching energy in Bn,nBn,n for odd n ≥ 11 is Pn6, which is the only graph attaining the maximum value of the energy among all the (bipartite) unicyclic graphs for n ≥ 16.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 268, 1 October 2015, Pages 644–656
Journal: Applied Mathematics and Computation - Volume 268, 1 October 2015, Pages 644–656
نویسندگان
Lin Chen, Jinfeng Liu,