A construction for infinite families of semisymmetric graphs revealing their full automorphism group
From MaRDI portal
Publication:2248574
DOI10.1007/s10801-013-0475-4zbMath1293.05232arXiv1301.1794MaRDI QIDQ2248574
Sara Rottey, Philippe Cara, Geertrui Van de Voorde
Publication date: 27 June 2014
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1794
05C75: Structural characterization of families of graphs
05C62: Graph representations (geometric and intersection representations, etc.)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Some semisymmetric graphs arising from finite vector spaces, On some cycles in Wenger graphs, Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras, Linear representations of finite geometries and associated LDPC codes
Cites Work
- Curve razionali normali e \(k\)-archi negli spazi finiti
- Arcs in PG(n,q), MDS-codes and three fundamental problems of B. Segre - some extensions
- The non-classical 10-arc of PG(4,9)
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- The solution to Beniamino Segre's problem \(I_ p,\),p=3, q=\(2^ k\).
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Complete \(k\)-arcs in PG(\(n,q\)), \(q\) even
- On linear representations of near hexagons
- On linear representations of \((\alpha,\beta)\)-geometries
- \(k\)-arcs and dual \(k\)-arcs
- New examples of graphs without small cycles and of large size
- Normal rational curves over prime fields
- An infinite family of semisymmetric graphs constructed from affine geometries
- Une propriété caractéristique des ovoides associes aux groupes de Suzuki
- An infinite series of regular edge- but not vertex-transitive graphs
- The isomorphism problem for linear representations and their graphs The isomorphism problem for linear representations and their graphs
- Regular line-symmetric graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item