Molecular MultiGraph and Molecular Iterative MultiGraph

20 August 2025, Version 1
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

A multigraph permits multiple edges between the same pair of vertices, allowing the modeling of repeated or parallel relationships in networks and systems. An iterative multigraph is obtained by repeatedly applying multigraph transformations, generating a sequence of graphs that capture evolving multi-edge connectivity patterns. A molecular graph represents the structure of a chemical compound, where vertices correspond to atoms and edges represent chemical bonds. A molecular multigraph extends this concept by allowing multiple bonds (edges) between the same pair of atoms (vertices). Since research on iterative multigraphs is still in its early stages, applications in chemistry and related domains remain largely unexplored. In this paper, we present the formal definition of the Molecular Iterative-MultiGraph.

Keywords

MultiGraph
Iterative MultiGraph
Molecular Graph
Molecular MultiGraph

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.