On edge but not vertex transitive regular graphs

From MaRDI portal
Revision as of 05:23, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2549702

DOI10.1016/0095-8956(72)90030-5zbMath0228.05114OpenAlexW1963899800WikidataQ56001774 ScholiaQ56001774MaRDI QIDQ2549702

I. Z. Bouwer

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90030-5




Related Items (49)

Semisymmetric graphs admitting primitive groups of degree \(9p\)Tetravalent edge-transitive graphs of girth at most 4Classifying cubic edge-transitive graphs of order \(8p\)Semisymmetric graphs from polytopesSemisymmetric elementary abelian covers of the Heawood graphSemisymmetric graphs of order \(6p ^{2}\) and prime valencyPentavalent semisymmetric graphs of square‐free orderSemisymmetric graphs of order twice prime powers with the same prime valencySemiregular polytopes and amalgamated C-groupsEdge cosymmetric graphsCUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2A worthy family of semisymmetric graphsAn infinite family of semisymmetric graphs constructed from affine geometriesRecipes for edge-transitive tetravalent graphsAffine primitive groups and semisymmetric graphsSemisymmetric graphs of order \(2p^3\)Cubic edge-transitive graphs of order 2\(p^{3}\)An infinite family of biprimitive semisymmetric graphsSome semisymmetric graphs arising from finite vector spacesEdge-transitive cyclic regular covers of the Möbius-Kantor graphSemisymmetric graphsSome properties of graphs constructed from 2-designsSemisymmetric cubic graphs as regular covers of \(K_{3,3}\)Linking rings structures and semisymmetric graphs: Cayley constructionsSemisymmetric Zp-covers of the C20 graphHighly symmetric subgraphs of hypercubesSemisymmetry of generalized Folkman graphsOn cubic graphs admitting an edge-transitive solvable groupThe genus of the Gray graph is 7Edge-transitive regular \(Z_n\)-covers of the Heawood graphA classification of semisymmetric graphs of order \(2p^3\): unfaithful caseCubic semisymmetric graphs of order \(6p^{3}\)A census of semisymmetric cubic graphs on up to 768 verticesConstructing cubic edge- but not vertex-transitive graphsCubic semisymmetric graphs of order \(2qp^2\)Cycle regular graphs need not be transitiveOn dispersable book embeddingsSemisymmetric prime-valent graphs of order \(2p^3\)Classifying cubic semisymmetric graphs of order \(18p^n\)New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfacesCubic semisymmetric graphs of order \(8p ^{3}\)Biprimitive graphs of smallest orderAn infinite family of cubic edge- but not vertex-transitive graphsPrimitive Permutation Representations of PSL(3, p) and Its ApplicationsA classification of semisymmetric graphs of order 2pqLocally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and HahnOn symmetric subgraphs of the 7-cube: An overviewNote on infinite families of trivalent semisymmetric graphsBridging semisymmetric and half-arc-transitive actions on graphs




Cites Work




This page was built for publication: On edge but not vertex transitive regular graphs