arXiv (All)
open access
Quasi-strongly regular digraphs constructed from transitive groups of degree $n\leq 110$
In this paper we present a method for constructing directed regular graphs from a transitive permutation group. This method is a generalization of a construction method for transitive 1-designs from a finite group, described in \cite{dean1}. Using this construction, we prove the existence of directe
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
- Counterexamples to Aigner's majorization conjecture for star-forest search#1142885
- Explosive appearance of cores and bootstrap percolation on lattices#1079639
- A $2/3$ Bound for Vizing's Conjecture#997511
- Operation-Type-Aware Client Routing for Leader-Based Consensus Datastores#819841
- Operation-Type-Aware Client Routing for Leader-Based Consensus Datastores#809845
Record · ID 996991
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