Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Graphing and Grafting Graphene: Classifying Finite Topological Defects

Published

Author(s)

Eric Cockayne

Abstract

The structure of finite-area topological defects in graphene is described in terms of both the direct honeycomb lattice and its dual triangular lattice. Such defects are equivalent to cutting out a patch of graphene and replacing it with a different patch with the same number of dangling bonds. An important subset of these defects, bound by a closed loop of alternating 5- and 7-membered carbon rings, explains most finite-area topological defects that have been experimentally observed. Previously unidentified defects seen in scanning tunneling microscope (STM) images of graphene grown on SiC are identified as isolated divacancies or divacancy clusters.
Citation
Physical Review B
Volume
85

Keywords

graphene, defects, topological defects, STM images, simulations

Citation

Cockayne, E. (2012), Graphing and Grafting Graphene: Classifying Finite Topological Defects, Physical Review B, [online], https://doi.org/10.1103/PhysRevB.85.125409, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=908756 (Accessed October 17, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created March 8, 2012, Updated September 29, 2025
Was this page helpful?