!!Projects per year
ملخص
The number of matching's in a graph is known as the Hosoya index of the graph. The problem of computing Hosoya index is #P-complete. If the adjacent edges are sequentially ordered, then we show that a polynomial algorithm can be designed. The significance of this algorithm is demonstrated by computing Hosoya index for certain chemical compounds such as Pyroxene. This algorithm can be applied to grid like chemical compounds such as sodium chloride, carbon nanotubes, naphtalenic nanotube etc.
| اللغة الأصلية | English |
|---|---|
| الصفحات (من إلى) | 196-205 |
| عدد الصفحات | 10 |
| دورية | International Journal of Computer Aided Engineering and Technology |
| مستوى الصوت | 11 |
| رقم الإصدار | 2 |
| المعرِّفات الرقمية للأشياء | |
| حالة النشر | Published - 2019 |
بصمة
أدرس بدقة موضوعات البحث “An efficient Hosoya index algorithm and its application'. فهما يشكلان معًا بصمة فريدة.المشاريع
- 1 منتهي
-
Graph Theory General Position Problem with applications
Manuel, P. D. (PI)
18/12/17 → 17/12/18
المشروع: RESEARCH PROJECT
قم بذكر هذا
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver