An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.

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. Cited by 1 paper.

0numbers the graph read from it

0cells of the map it votes in

1citing 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

1 citing paper in PubMed.

Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.Entropy (Basel, Switzerland) · 2020
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

3 authors.

Naveed Ahmed AzamDepartment of Applied Mathematics and Physics, Kyoto University, Kyoto 606-8502, Japan.ORCID 0000-0002-7941-3419

Aleksandar ShurbevskiDepartment of Applied Mathematics and Physics, Kyoto University, Kyoto 606-8502, Japan.ORCID 0000-0001-9224-6929

Hiroshi NagamochiDepartment of Applied Mathematics and Physics, Kyoto University, Kyoto 606-8502, Japan.

Funding

Japan Society for the Promotion of Science 18J23484

6 · The paper itself

Abstract

Graph enumeration with given constraints is an interesting problem considered to be one of the fundamental problems in graph theory, with many applications in natural sciences and engineering such as bio-informatics and computational chemistry. For any two integers n≥1 and Δ≥0, we propose a method to count all non-isomorphic trees with

Indexed as

chemical graphsdynamic programmingenumerationpolymer topologytrees

Identifiers

PMID33286692

DOI10.3390/e22090923

PMCPMC7597174

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.