arXiv (All)
open access
The classification of endpoint-transitive graphs with geodesic condition
We introduce endpoint k-path-transitive graphs, in which the automorphism group fixing two prescribed vertices pointwise acts transitively on the paths of length k joining them. We study the geodesic case, where k equals the distance between these vertices. We identify the union of these geodesics w
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
- Fast approximate shortest paths in the congested clique#301330
- Robust Repulsion for Growing Crowns in Linear Hypergraphs#615137
- Robust Repulsion for Growing Crowns in Linear Hypergraphs#614170
- Chimera states on m-directed hypergraphs#160901
- Compositional route types : bridging configurational and urban tissue analysis#397250
Record · ID 1131823
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