A worthy family of semisymmetric graphs
type: Item
instance of: scholarly article
title: A worthy family of semisymmetric graphs
zbMATH Open document ID: 1021.05048
DOI: 10.1016/S0012-365X(03)00048-7
published in: Discrete Mathematics
publication date: 2003-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 1985966
zbMATH Keywords: symmetry
zbMATH Keywords: graph automorphism group
author: Steve Wilson
MaRDI profile type: Publication
cites work: An Edge but not Vertex Transitive Cubic Graph*
cites work: On edge but not vertex transitive regular graphs
cites work: An infinite family of biprimitive semisymmetric graphs
cites work: Biprimitive graphs of smallest order
cites work: A classification of semisymmetric graphs of order 2pq
cites work: Regular line-symmetric graphs
cites work: Associative products of graphs
cites work: Q3487414
cites work: Q3765805
cites work: 25 pretty graph colouring problems
cites work: Q3931423
cites work: Constructing cubic edge- but not vertex-transitive graphs
cites work: The Gray graph revisited
cites work: Semisymmetry of generalized Folkman graphs
cites work: The Categorical Product of Graphs
cites work: The Kronecker Product of Graphs
cites work: Semi-transitive graphs
full work available at URL: s0012-365x(03)00048-7
OpenAlex ID: W2079084052
description: scientific article; zbMATH DE number 1985966