Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 187

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Grain boundary loops in graphene

Open access
Cockayne, Eric, Rutter, Gregory M., Guisinger, Nathan P., Crain, Jason N., First, Phillip N., Stroscio, Joseph A.·2011·Physical Review B

Abstract

Topological defects can affect the physical properties of graphene in unexpected ways. Harnessing their influence may lead to enhanced control of both material strength and electrical properties. Here we present a class of topological defects in graphene composed of a rotating sequence of dislocations that close on themselves, forming grain boundary loops that either conserve the number of atoms in the hexagonal lattice or accommodate vacancy or interstitial reconstruction, while leaving no unsatisfied bonds. One grain boundary loop is observed as a ``flower'' pattern in scanning tunneling microscopy studies of epitaxial graphene grown on SiC(0001). We show that the flower defect has the lowest energy per dislocation core of any known topological defect in graphene, providing a natural explanation for its growth via the coalescence of mobile dislocations.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevb.83.195425

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 187

Metadata

Authors
Cockayne, E., Rutter, G. M., Guisinger, N. P., Crain, J. N., First, P. N., & Stroscio, J. A.
Venue
Physical Review B
Published
2011-05-12
Volume
83
Issue
19
ISSN
  • 1098-0121 (ISSN-L)
  • 1550-235X
OpenAlex
W1974943886
Cited by
187
References
2
FWCI
11.46
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Grain boundary loops in graphene. https://app.cochat.ai/papers/10.1103/physrevb.83.195425
The paper
Cockayne, E., Rutter, G. M., Guisinger, N. P., Crain, J. N., First, P. N., & Stroscio, J. A. (2011). Grain boundary loops in graphene. Physical Review B. https://doi.org/10.1103/physrevb.83.195425

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.