| Display title | Half-transitive graph |
| Default sort key | Half-transitive graph |
| Page length (in bytes) | 2,659 |
| Namespace ID | 0 |
| Page ID | 229408 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>John Marlo |
| Date of page creation | 07:23, 28 September 2021 |
| Latest editor | imported>John Marlo |
| Date of latest edit | 07:23, 28 September 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In the mathematical field of graph theory, a half-transitive graph is a graph that is both vertex-transitive and edge-transitive, but not symmetric. In other words, a graph is half-transitive if its automorphism group acts transitively upon both its vertices and its edges, but not on ordered pairs of... |
