Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter
Chen, Lin · Liu, Jinfeng · Shi, Yongtang
الأصل · EN
Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let G be a simple graph of order n and μ₁,μ₂,,μₙ be the roots of its matching polynomial. The matching energy of G is defined to be the sum of the absolute values of μᵢ(i=1,2,,n). In this paper, we characterize the graphs with minimal matching energy among all unicyclic and bicyclic graphs with a given diameter d.
الترجمة العربية
لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.