On edge but not vertex transitive regular graphs
From MaRDI portal
Publication:2549702
Cites work
- An Edge but not Vertex Transitive Cubic Graph*
- Graph multiplication
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- scientific article; zbMATH DE number 3307339 (Why is no real title available?)
- On the number of bi-colored graphs
- On The Number of Symmetry Types of Boolean Functions of n Variables
- Parallel concepts in graph theory
- Regular line-symmetric graphs
- Self-dual configurations and regular graphs
Cited in
(53)- Edge cosymmetric graphs
- Biprimitive graphs of smallest order
- On symmetric subgraphs of the 7-cube: An overview
- A worthy family of semisymmetric graphs
- An infinite family of semisymmetric graphs constructed from affine geometries
- Cubic edge-transitive graphs of order 2\(p^{3}\)
- Some properties of graphs constructed from 2-designs
- The genus of the Gray graph is 7
- An infinite family of cubic edge- but not vertex-transitive graphs
- Note on infinite families of trivalent semisymmetric graphs
- Bridging semisymmetric and half-arc-transitive actions on graphs
- Semisymmetric graphs of order \(6p ^{2}\) and prime valency
- Affine primitive groups and semisymmetric graphs
- Semisymmetric prime-valent graphs of order \(2p^3\)
- Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn
- A classification of semisymmetric graphs of order \(2p^3\): unfaithful case
- Cubic semisymmetric graphs of order 2qp^2
- Semisymmetric graphs of order \(2p^3\)
- A census of semisymmetric cubic graphs on up to 768 vertices
- Semisymmetric graphs admitting primitive groups of degree 9p
- Classifying cubic edge-transitive graphs of order \(8p\)
- CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2
- Semiregular polytopes and amalgamated C-groups
- A classification of semisymmetric graphs of order 2pq
- Constructing cubic edge- but not vertex-transitive graphs
- An infinite family of biprimitive semisymmetric graphs
- Linking rings structures and semisymmetric graphs: Cayley constructions
- Recipes for edge-transitive tetravalent graphs
- Some semisymmetric graphs arising from finite vector spaces
- Semisymmetric \(Z_p\)-covers of the \(C20\) graph
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
- Primitive permutation representations of \(\mathrm{PSL}(3,p)\) and its applications.
- Semisymmetry of generalized Folkman graphs
- Cycle regular graphs need not be transitive
- Semisymmetric elementary abelian covers of the Heawood graph
- Pentavalent semisymmetric graphs of square‐free order
- Semisymmetric graphs of order twice prime powers with the same prime valency
- Edge-transitive cyclic regular covers of the Möbius-Kantor graph
- Polycyclic geometric realizations of the Gray configuration
- On biprimitive semisymmetric graphs
- Highly symmetric subgraphs of hypercubes
- The Gray graph is a unit-distance graph
- On cubic graphs admitting an edge-transitive solvable group
- Cubic semisymmetric graphs of order \(6p^{3}\)
- On s-flag-transitive designs and semisymmetric graphs
- The symmetric division eccentric index of two infinite classes of fullerenes
- Classifying cubic semisymmetric graphs of order \(18p^n\)
- Cubic semisymmetric graphs of order \(8p ^{3}\)
- Tetravalent edge-transitive graphs of girth at most 4
- Semisymmetric graphs from polytopes
- Semisymmetric graphs
- Semisymmetric cubic graphs as regular covers of \(K_{3,3}\)
- Edge-transitive regular \(Z_n\)-covers of the Heawood graph
This page was built for publication: On edge but not vertex transitive regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549702)