Counting chemical isomers with multivariate generating functions

Rana Shojaei & Thilo Gross

Network Science2026https://doi.org/10.1017/nws.2026.10025article
AJG 1
Weight
0.50

What the paper says

Counting the number of isomers of a chemical molecule is one of the formative problems of graph theory. However, recent progress has been slow, and the problem has largely been ignored in modern network science. Here we provide an introduction to the mathematics of counting network structures and then use it to derive results for two new classes of molecules. In contrast to previously studied examples, these classes take additional chemical complexity into account and thus require the use of multivariate generating functions. The results illustrate the elegance of counting theory, highlighting it as an important tool that should receive more attention in network science.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1017/nws.2026.10025

Or copy a formatted citation

@article{rana2026,
  title        = {{Counting chemical isomers with multivariate generating functions}},
  author       = {Rana Shojaei & Thilo Gross},
  journal      = {Network Science},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1017/nws.2026.10025},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Counting chemical isomers with multivariate generating functions

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.