arXiv (All)
open access
On the Generating Graph of Finite Abelian Groups
The generating graph $Γ(G)$ of a group $G$ is the graph whose vertex set is $G$, where two distinct vertices are adjacent if and only if they generate $G$. In this paper, we systematically study the structure of generating graphs of finite abelian groups (non-cyclic) and determine the set of all gen
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
- On the Generating Graph of Finite Abelian Groups#809579
- Cheaper by the Batch: Shared Traversal for Genotype Graph Editing#1118699
- Quantum Algorithms for Minimum Generating Set#1154521
- 42 U.S.C. § 13573 — Generation projects#589577
- Minimal Generation of Mapping Class Groups: Nonorientable Case#439635
Record · ID 819575
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