Evidence map›Paper›PMID 33287063›Full record

ArticleEntropy (Basel, Switzerland)2020

Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

3 authors.

Naveed Ahmed AzamDepartment of Applied Mathematics and Physics, Kyoto University, Kyoto 606-850, Japan.ORCID 0000-0002-7941-3419
Aleksandar ShurbevskiDepartment of Applied Mathematics and Physics, Kyoto University, Kyoto 606-850, Japan.ORCID 0000-0001-9224-6929
Hiroshi NagamochiDepartment of Applied Mathematics and Physics, Kyoto University, Kyoto 606-850, Japan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Cycle rank is an important notion that is widely used to classify, understand, and discover new chemical compounds. We propose a method to enumerate all non-isomorphic tree-like graphs of a given cycle rank with self-loops and no multiple edges. To achieve this, we develop an algorithm to enumerate all non-isomorphic rooted graphs with the required constraints. The idea of our method is to define a canonical representation of rooted graphs and enumerate all non-isomorphic graphs by generating the canonical representation of rooted graphs. An important feature of our method is that for an integer n≥1, it generates all required graphs with

Indexed as

canonical representationchemical graphcycle rankenumerationpolymer topology

Identifiers

PMID33287063
PMCPMC7711681

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.