arXiv (All)
open access
On embeddings of the difference graph of the intersection power graph and the power graph
The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The intersection power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices $x$, $y$ are adjacent if $\langle
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 embeddings of the difference graph of the intersection power graph and the power graph#921092
- A note on the generator subgraph of a graph#471108
- Matching complements in subcubic graphs and a proof of the 3-Decomposition Conjecture#926194
- Cyclic Subgroup Graph of a Group#1011979
- Introvert Clustering for Distributed Graph Algorithms#673484
Record · ID 925328
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