ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Armchair or Zigzag? A tool for characterizing graphene edge

Singh, Abhishek K and Penev, Evgeni S and Yakobson, Boris I (2011) Armchair or Zigzag? A tool for characterizing graphene edge. In: Computer Physics Communications, 182 (3). pp. 804-807.

[img] PDF
Armchair.pdf - Published Version
Restricted to Registered users only

Download (614kB) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.cpc.2010.11.029

Abstract

Electronic, magnetic, and structural properties of graphene flakes depend sensitively upon the type of edge atoms. We present a simple software tool for determining the type of edge atoms in a honeycomb lattice. The algorithm is based on nearest neighbor counting. Whether an edge atom is of armchair or zigzag type is decided by the unique pattern of its nearest neighbors. Particular attention is paid to the practical aspects of using the tool, as additional features such as extracting out the edges from the lattice could help in analyzing images from transmission microscopy or other experimental probes. Ultimately, the tool in combination with density-functional theory or tight-binding method can also be helpful in correlating the properties of graphene flakes with the different armchair-to-zigzag ratios. Program summary Program title: edgecount Catalogue identifier: AEIA_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEIA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 66685 No. of bytes in distributed program, including test data, etc.: 485 381 Distribution format: tar.gz Programming language: FORTRAN 90/95 Computer: Most UNIX-based platforms Operating system: Linux, Mac OS Classification: 16.1, 7.8 Nature of problem: Detection and classification of edge atoms in a finite patch of honeycomb lattice. Solution method: Build nearest neighbor (NN) list; assign types to edge atoms on the basis of their NN pattern. Running time: Typically similar to second(s) for all examples. (C) 2010 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Publication: Computer Physics Communications
Publisher: Elsevier Science
Additional Information: Copyright of this article belongs to Elsevier Science.
Keywords: Honeycomb lattice; Graphene; Edge atom types; FORTRAN 90/95
Department/Centre: Division of Chemical Sciences > Materials Research Centre
Date Deposited: 08 Mar 2011 06:48
Last Modified: 08 Mar 2011 06:48
URI: http://eprints.iisc.ac.in/id/eprint/35904

Actions (login required)

View Item View Item