arXiv (All)
open access
Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups
The difference graph $D(G)$ of a finite group $G$ is obtained from the edge difference between its intersection power graph and power graph, after deleting isolated vertices. This graph has already been studied, with sufficient conditions for connectedness and a diameter bound $6$ for finite groups
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
- Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups#809561
- The entropy of coclass one and of SmallGroup(729,45)#973768
- On the sample complexity of the generalized hidden shift problem over arbitrary finite groups#973453
- The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$#998725
- A ‘Non-Power’ Looks at Separation of Powers#672657
Record · ID 819557
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