arXiv (All)
open access
Simple factor graphs associated with split graphs
We introduce and study a loopless multigraph associated with a split graph $(S,K,I)$: its factor graph $Φ(S,K,I)$, whose vertex set is $I$ and whose edges, counted with multiplicity, record the 2-switches acting on $S$. In contrast with the $A_4$-structure $\mathcal{A}_4(S)$ introduced by Barrus and
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
- More graphs with pair state transfer#612780
- More graphs with pair state transfer#611303
- Cybersecurity knowledge graphs construction and quality assessment#671855
- Cybersecurity knowledge graphs#671615
- Recent Progress of Using Knowledge Graph for Cybersecurity#671728
Record · ID 925883
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