Abstract

Nanotechnology has gained recently much attention in research to develop new carbon based materials with unique properties. It generates many new materials and devices with a wide range of applications in medicine, electronics, and computer. Carbon nanotubes (CNTs) are one of the most promising resources in the field of nanotechnology. Mathematically, assembling in predictable arrays is equivalent to packing in graphs. An H-packing of a graph G is the set of vertex disjoint subgraphs of G, each of which is isomorphic to a fixed graph H. In this paper we determine perfect and almost perfect H-packing and an induced H-packing k-partition number for Armchair carbon nanotube ACNT[n, m], Zigzag carbon nanotube ZCNT[n, m], Zigzag polyhex carbon nanotube $$TUHC_{6}[2m,n]$$ , Boron triangular carbon nanotubes $$BNT_{t}[n, m]$$ , $$TUC_{4}C_{8}(R)$$ , $$TUC_{4}C_{8}(S)$$ , $$HAC_{5}C_{6}C_{7} [n, m]$$ and $$HAC_{5}C_{7}[n, m]$$ with H isomorphic to $$P_{3}$$ . Further we investicate $$C_{4}$$ -packing for $$TUC_{4}C_{8}(R)$$ .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call