Computational aspects of carbon and boron nanotubes

Molecules

Volumn 15, Issue 12, 2010, Pages 8709-8722

  Manuel, Paul ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Boron nanotubes; Broadcasting algorithm; Carbon nanotubes; Matching ratio; Maximum independent set; Perfect matching

Indexed keywords

BORON; CARBON NANOTUBE;

ARTICLE; CHEMICAL STRUCTURE; CHEMISTRY; ULTRASTRUCTURE;

BORON; MODELS, MOLECULAR; NANOTUBES, CARBON;

EID: 78650651150     PISSN: None     EISSN: 14203049     Source Type: Journal    
DOI: 10.3390/molecules15128709     Document Type: Article

References (36)

1. Halford, B. Unusual properties of nanotubes made from inorganic materials offer intriguing possibilities for applications. Chem. Eng. News 2005, 83, 30-33.
2. Berger, M. Nanotechnology in space. Nanowerk Nanotechnology Spotlight, http://www.nanowerk.com/spotlight (accessed on 29 June 2007).
3. Perlet, J. The Global Market for Carbon Nanotubes to 2015: A Realistic Assessment; Nanoposts: Dublin, Ireland, 2010.
4. Battersby, S. Boron nanotubes could outperform carbon. New Scientist. http://www.newscientist.com (accessed on 4 January 2008).
5. Kunstmann, J.; Quandt, A. Broad boron sheets and boron nanotubes: An ab initio study of structural, electronic, and mechanical properties. Phys. Rev. B 2006, 74, 354-362.
6. Miller, P. Boron nanotubes beat carbon at its own game. Engadget. http://www.engadget.com (accessed on 6 January 2008).
7. Tang, H.; Ismail-Beigi, S. Novel precursors for boron nanotubes: The competition of two-center and three-center bonding in boron sheets. Phys. Rev. Lett. 2007, 99, 115501-115504.
8. Yu, J.; Yu, D.; Chen, Y.; Lin, M.Y.; Li, J.; Duan, W. Narrowed bandgaps and stronger excitonic effects from small boron nitride nanotubes. Chem. Phys. Lett. 2009, 476, 240-243.
9. Tang, H.; Ismail-Beigi, S. Self-doping in boron sheets from first principles: A route to structural design of metal boride nanostructures, Phys. Rev. B 2009, 80, 134113-134115.
10. Clark, K.; Hassanien, A.; Khan, S.; Braun, K.F.; Tanaka, H.; Hla, S.W. Superconductivity in just four pairs of (BETS)2GaCl4 molecules. Nat. Nanotechnol. 2010, 5, 261-265.
11. Lee, R.K.F.; Cox, B.J., Hill, J.M. Ideal Polyhedral Model for Boron Nanotubes with Distinct Bond Lengths. J. Phys. Chem. C 2009, 113, 19794-19805
12. Yang, X.; Ding, Y.; Ni, J. Ab initio prediction of stable boron sheets and boron nanotubes: Structure, stability and electronic properties. Phys. Rev. B 2008, 77, 041402(R).
13. Tian, F.Y.; Wang, Y.X.; Lo, V.C.; Sheng, J. An ab initio investigation of boron nanotube in ring like cluster form. Appl. Phys. Lett. 2010, 96, 131901-131903.
14. Chen, Y.R.; Weng, C.; Sun, S.J. Electronic properties of zigzag and armchair carbon nanotubes under uniaxial strain. Journal of Applied Physics 2008, 104, 114310-114317.
15. Harris, P.J.F. Carbon Nanotube Science: Synthesis, Properties and Applications; Cambridge University Press: Cambridge, UK, 2009.
16. Manuel, P.; Guizani, M. Broadcasting algorithms of carbon nanotubes. J. Comput. Theor. Nanosci. 2010, in press.
17. Madhavan, C.E.V. Approximation algorithm for maximum independent set in planar triangle-free graphs. Lect. Note. Comput. Sci. 1984, 181, 381-392.
18. 0.304n) Algorithm for Solving Maximum Independent Set Problem. IEEE Trans. Comput. 1986, C-35, 847-851.
19. Soares J.; Stefanes, M.A. Algorithms for Maximum Independent Set in Convex Bipartite Graphs. Algorithmica 2009, 53, 35-49.
20. Alekseev, V.E.; Lozin, V.; Malyshev, D.; Milanic, M. The Maximum independent set Problem in Planar Graphs. Lect. Note. Comput. Sci. 2008, 5162, 96-107.
21. Brandstadt, A.; Klembt, T.; Lozin, V.V.; Mosca, R. Independent sets of maximum weight in apple-free graphs. Lect. Note. Comput. Sci. 2008, 5369, 848-858.
22. Brodal, G.S.; Georgiadis, L.; Hansen, K.A.; Katriel, I. Dynamic Matchings in Convex Bipartite Graphs. Lect. Note. Comput. Sci. 2007, 4708, 406-417.
23. Fajtlowicz, S.; John, P.E.; Sachs, H. On Maximum Matchings and Eigen values of Benzenoid Graphs. Croat. Chem. Acta 2005, 78 195-201.
24. Hansen, P.; Zheng, M. A linear algorithm for perfect matching in hexagonal systems. Discrete Math. 1993, 122, 179-196.
25. Klavžar, S.; Salem, K.; Taranenko, A. Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems. Comput. Math. Appl. 2010, 59, 506-513.
26. Horton, R.; Moran, L.A.; Scrimgeour, K.G.; Perry, M.D.; Rawn, J.D. Principles of Biochemistry, 4th ed.; Pearson/Prentice Hall: New York, NY, USA, 2006.
27. Middendorf, M. Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2. Inf. Process. Lett. 1993, 46, 281-287.
28. Tang, Y.; Zhou, M. A Novel Broadcasting Algorithm for Wireless Sensor Networks. Lect. Note. Comput. Sci. 2006, 4330, 474-484.
29. Chepoi, V.; Dragan, F.F.; Vaxès, Y. Addressing, distances and routing in triangular systems with applications in cellular networks. Wirel. Netw. 2006, 12, 671-679.
30. Su, Y.H.; Lin, C.C.; Lee, D.T. Broadcasting in Heterogeneous Tree Networks. Lect. Note. Comput. Sci. 2010, 6196, 368-377.
31. Stojmenović, I. Honeycomb Networks: Topological Properties and Communication Algorithms. IEEE Trans. Parall. Distrib. Sys. 1997, 8, 1036-1042. (Pubitemid 127770504)
32. García, F.; Solano, J.; Stojmenović, I.; Stojmenović, M. Higher dimensional hexagonal networks. J. Parall. Distrib. Comput. 2003, 63, 1164-1172.
33. Shen, Z. A generalized broadcasting schema for the mesh structures. Appl. Math. Comput. 2007, 186, 1293-1310.
34. Li, J.; Chen, M.; Xiang, Y.; Yao, S. Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees. Lect. Note. Comput. Sci. 2010, 4672, 220-230.
35. Nguyen, N.C.; Vo, N.M.D.; Lee, S. Efficient Routing and Broadcasting Algorithm in de Bruijn Networks. Lect. Note. Comput. Sci. 2005, 3358, 677-687.
36. Kouvatsos, D.D.; Mkwawa, I.M. Broadcasting schemes for hypercubes with background traffic. J. Sys. Software 2004, 73, 3-14.