arXiv (All)
open access
Exact counting of unlabeled quartic graphs by permutation-cycle aggregation
The number of unlabeled regular graphs can be expressed as an average of fixed-point counts over vertex permutations, but evaluating each fixed-point count still requires the degree constraints to be enforced. We give an exact recurrence that processes one complete permutation cycle at a time and re
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs#1123701
- Faster network motif discovery by counting isomorphic subtrees#1143287
- Vertex-transitive quantum graphs#1104446
- Laziness of Quantum Walks on Graphs#659293
- Laziness of Quantum Walks on Graphs#657157
Record · ID 1106106
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive