Counting unlabelled multigraphs with three nodes
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915739119648768 |
|---|---|
| author | Bonato, Andrea |
| author_facet | Bonato, Andrea |
| contents | Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization and biological function of chromatin, which is often folded into complex polymer networks whose structure is closely tied to patterns of gene expression. A fundamental yet challenging aspect in applying graph theory to these areas is the enumeration of multigraphs, especially under structural constraints For example, when coupled with the statistical mechanics of polymer networks, the ability to identify traversable and connected multigraphs provides powerful tools for predicting statistically favored motifs that may arise within chromatin networks. In this work, by counting the adjacency matrices, we derive polynomial expressions that enumerate all connected, undirected, and unlabeled multigraphs with three nodes and fixed degree, and provide a method to efficiently generate them. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_13163 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Counting unlabelled multigraphs with three nodes Bonato, Andrea Soft Condensed Matter Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization and biological function of chromatin, which is often folded into complex polymer networks whose structure is closely tied to patterns of gene expression. A fundamental yet challenging aspect in applying graph theory to these areas is the enumeration of multigraphs, especially under structural constraints For example, when coupled with the statistical mechanics of polymer networks, the ability to identify traversable and connected multigraphs provides powerful tools for predicting statistically favored motifs that may arise within chromatin networks. In this work, by counting the adjacency matrices, we derive polynomial expressions that enumerate all connected, undirected, and unlabeled multigraphs with three nodes and fixed degree, and provide a method to efficiently generate them. |
| title | Counting unlabelled multigraphs with three nodes |
| topic | Soft Condensed Matter |
| url | https://arxiv.org/abs/2601.13163 |