arXiv (All)
open access
Counting five-node subgraphs
For a simple undirected graph $G$, we derive exact formulae for the number of copies of each of the 21 non-isomorphic connected graphs on five vertices. For nine of these graphs (the stingray, spinning top, kite, ufo, crown, envelope, lamp, arrowhead, and cat's cradle) the resulting analytical formu
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
- Quantitative genetics of lifetime growth curves in a lizard#332413
- Growth-Inspired Graph Generation and Inverse Design of Mechanical Lattices via Dot Matrices Database Augmentation and GCNN#1076953
- Binary Companions Of Evolved Stars In APOGEE DR14: Search Method And Catalog Of ∼5000 Companions#19662
- Young Bacchus and Companions#1056109
- Boreas and Oreithyia#1056107
Record · ID 1014430
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