arXiv (OAI Expanded)
open access
The Cayley Completion of a Graph
A finite connected graph is rarely a Cayley graph. We measure how far it is from being one: given $G$ with $n$ vertices and $m$ edges, how few edges must be added, or added and deleted, before the result is a Cayley graph of an abelian group of order $n$ on the same vertex set? This defines two inva
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
- The Cayley Completion of a Graph#818933
- Spectral Algebras of Abelian Cayley Graphs#986991
- Premaniplexes of rank $3$ and $4$ as symmetry type graphs of maniplexes#1070589
- Miscellanea Curiosa, Vol. 1 Containing a collection of some of the principal phaenomena in nature, accounted for by the greatest philosophers of this age#54106
- Positive and Negative Square Energies of $2$-Connected Graphs#926914
Record · ID 808941
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