شماره ركورد كنفرانس
3806
عنوان مقاله
Laplacian Minimum Covering Distance Energy
پديدآورندگان
Rahimi Sharbaf S Srahimi40@gmail.com Department of Mathematics, Shahrood University of Technology, Shahrood, Iran , Z.Espomahalli Z zohreh.espo@yahoo.com Department of Mathematics, Shahrood University of Technology, Shahrood, Iran
تعداد صفحه
4
كليدواژه
Minimum covering distance energy , Laplacian minimum covering distance matrix , Laplacian minimum covering distance energy of graphs.
سال انتشار
1396
عنوان كنفرانس
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
زبان مدرك
انگليسي
چكيده فارسي
In this paper, we will define the laplacian minimum covering distance energy
in graphs according to the laplacian minimum covering energy that suggested
by rajesh et.al LECd(G) is a graph of G which depends on its particular
minimum cover C. in this paper, we will computed the laplacian minimum
covering distance energies of two graphs: star graph and complete graph.Also,
we will estabish upper and lower bounds for LECd(G).
كشور
ايران
لينک به اين مدرک