共 32 条
Computing optimal electronic and mathematical properties of Buckyball nanoparticle using graph algorithms
被引:6
|作者:
Khataee, H. R.
[1
]
Ibrahim, M. Y.
[2
]
Sourchi, S.
[3
]
Eskandari, L.
[3
]
Noranis, M. A. Teh
[1
]
机构:
[1] Univ Putra Malaysia, Dept Comp Sci, Serdang, Malaysia
[2] Monash Univ, Sch Appl Sci & Engn, Melbourne, Vic 3004, Australia
[3] Univ Tabriz, Dept Comp Sci, Tabriz, Iran
来源:
关键词:
Buckyball;
Graph algorithms;
Dynamic programming;
Greedy algorithm;
Nanocomputational calculations;
HYPER-WIENER INDEX;
FULLERENES;
C-60;
BUCKMINSTERFULLERENE;
D O I:
10.1108/03321641211200491
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
Purpose - One of the significant underlying principles of nanorobotic systems deals with the understanding and conceptualization of their respective complex nanocomponents. This paper introduces a new methodology to compute a set of optimal electronic and mathematical properties of Buckyball nanoparticle using graph algorithms based on dynamic programming and greedy algorithm. Design/methodology/approach - Buckyball, C-60, is composed of sixty equivalent carbon atoms arranged as a highly symmetric hollow spherical cage in the form of a soccer ball. At first, Wiener, hyper-Wiener, Harary and reciprocal Wiener indices were computed using dynamic programming and presented them as: W(Buckyball) = 11870.4, WW(Buckyball) = 52570.9, Ha(Buckyball) = 1022 and RW(Buckyball) = 346.9. The polynomials of Buckyball, Hosoya and hyper-Hosoya, which are in relationship with Buckyball's indices, have also been computed. The relationships between Buckyball's indices and polynomials were then computed and demonstrated a good agreement with their mathematical equations. Also, a graph algorithm based on greedy algorithms was used to find some optimal electronic aspects of Buckyball's structure by computing the Minimum Weight Spanning Tree (MWST) of Buckyball. Findings - The computed MWST was indicated that for connecting sixty carbon atoms of Buckyball together: the minimum numbers of double bonds were 30; the minimum numbers of single bonds were 29; and the minimum numbers of electrons were 178. These results also had good agreement with the principles of the authors' used greedy algorithm. Originality/value - This paper has used the graph algorithms for computing the optimal electronic and mathematical properties of BB. It has focused on mathematical properties of BB including Wiener, hyper-Wiener, Harary and reciprocal Wiener indices as well as Hosoya and Hyper-Hosoya polynomials and computerized them with dynamic programming graph algorithms.
引用
收藏
页码:387 / 400
页数:14
相关论文