Evidence map›Paper›PMID 33375518›Full record

ArticlePolymers2020

Porous Graphene Composite Polymer Fibres.

Jubair Ahmed, Tanveer A Tabish, Shaowei Zhang, Mohan Edirisinghe

Abstract read
In one paragraph

Article in Polymers, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Casein fibres for wound healing.Journal of the Royal Society, Interface · 2023
    Article
  2. Review
  3. Article
  4. Review
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Jubair AhmedDepartment of Mechanical Engineering, University College London, London WC1E 7JE, UK.ORCID 0000-0003-3052-406X
Tanveer A TabishCollege of Engineering, Mathematics and Physical Sciences, University of Exeter, Exeter EX4 4QF, UK.ORCID 0000-0001-5602-056X
Shaowei ZhangUCL Cancer Institute, University College London, London WC1E 6DD, UK.
Mohan EdirisingheDepartment of Mechanical Engineering, University College London, London WC1E 7JE, UK.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Since the isolation of graphene, there have been boundless pursuits to exploit the many superior properties that this material possesses; nearing the two-decade mark, progress has been made, but more is yet to be done for it to be truly exploited at a commercial scale. Porous graphene (PG) has recently been explored as a promising membrane material for polymer composite fibres. However, controlling the incorporation of high surface area PG into polymer fibres remain largely unexplored. Additionally, most polymer-graphene composites suffer from low production rates and yields. In this paper, graphene-loaded microfibres, which can be produced at a very high rate and yield have been formed with a carrier polymer, polycaprolactone. For the first time, PG has been incorporated into polymer matrices produced by a high-output manufacturing process and analysed via multiple techniques; scanning electron microscopy (SEM), Raman spectroscopy, Fourier-transform infrared spectroscopy (FTIR) and X-ray diffraction (XRD). Raman spectra showed that single layer graphene structures were achieved, evidence for which was also backed up by the other techniques. Fibres with an average diameter ranging from 3-8 μm were produced with 3-5 wt% PG. Here, we show how PG can be easily processed into polymeric fibres, allowing for widespread use in electrical and ultrafiltration systems.

Indexed as

fibrespolycaprolactonepolymerporous graphene

Identifiers

PMID33375518
PMCPMC7795706

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.