arXiv (OAI Expanded)
open access
Vertex-transitive strongly regular graphs in the switching class of doubly transitive two-graphs
Let $G$ be a permutation group that acts $2$-transitively on the finite set $V$ and let $\mathcal{T}=(V,T)$ be a two-graph whose automorphism group contains $G$. In this paper, we classify those strongly regular graphs $Γ$ with vertex set $V$ whose automorphism group is a transitive maximal subgroup
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
- Vertex-transitive strongly regular graphs in the switching class of doubly transitive two-graphs#799542
- Spectra and eigenspaces of branched covers of graphs induced by local factorisation#1118364
- $E$-restricted Double Traces#984771
- Tree Theory#118149
- Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport#1049286
Record · ID 798119
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