A worthy family of semisymmetric graphs
From MaRDI portal
Publication:1408884
DOI10.1016/S0012-365X(03)00048-7zbMath1021.05048MaRDI QIDQ1408884
Publication date: 25 September 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Related Items
Some semisymmetric graphs arising from finite vector spaces, Distance magic labeling and two products of graphs, Semisymmetric elementary abelian covers of the Heawood graph, Edge-transitive cyclic regular covers of the Möbius-Kantor graph, Elementary abelian covers of graphs, Cubic semisymmetric graphs of order \(6p^{3}\), Cubic semisymmetric graphs of order \(8p ^{3}\), Tetravalent edge-transitive graphs of girth at most 4, Semisymmetric graphs, Cubic edge-transitive graphs of order 2\(p^{3}\), Vertex-transitive direct products of graphs, An infinite family of cubic edge- but not vertex-transitive graphs, Semisymmetric prime-valent graphs of order \(2p^3\), A classification of semisymmetric graphs of order \(2p^3\): unfaithful case, Cubic semisymmetric graphs of order \(2qp^2\), Edge-transitive graphs of small order and the answer to a 1967 question by Folkman, Semisymmetric graphs of order \(2p^3\), A census of semisymmetric cubic graphs on up to 768 vertices, Distance-balanced graphs: symmetry conditions, Semisymmetric graphs admitting primitive groups of degree \(9p\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Associative products of graphs
- Biprimitive graphs of smallest order
- On edge but not vertex transitive regular graphs
- The Kronecker Product of Graphs
- Semi-transitive graphs
- A classification of semisymmetric graphs of order 2pq
- Regular line-symmetric graphs
- The Categorical Product of Graphs
- An Edge but not Vertex Transitive Cubic Graph*
- 25 pretty graph colouring problems
- Semisymmetry of generalized Folkman graphs