Links between two semisymmetric graphs on 112 vertices via association schemes

DOI10.1016/j.jsc.2011.12.040zbMath1244.05235OpenAlexW2023580423MaRDI QIDQ432745

Matan Ziv-Av, Josef Lauri, Mikhail H. Klin

Publication date: 4 July 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.040

zbMATH Keywords

association schemecomputer algebradejter graphdeza graphdouble coverLjubljana graphNikolaev graphoverlarge set of designssemisymmetric graph

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Association schemes, strongly regular graphs (05E30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability

Uses Software

• GAP
• nauty
• GRAPE

Cites Work

• Links between two semisymmetric graphs on 112 vertices via association schemes
• Highly symmetric subgraphs of hypercubes
• Some new strongly regular graphs
• Higmanian rank-5 association schemes on 40 points
• Coherent algebras
• A characterization of particular symmetric (0,1) matrices
• Galois correspondence between permutation groups and cellular rings (association schemes)
• On symmetric subgraphs of the 7-cube: An overview
• Parallel concepts in graph theory
• Coherent configurations. I
• Rank 5 association schemes and triality
• A census of semisymmetric cubic graphs on up to 768 vertices
• Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
• Examples of computer experimentation in algebraic combinatorics
• Double covers and logics of graphs
• A graph which is edge transitive but not arc transitive
• The Gray graph revisited
• Deza graphs: A generalization of strongly regular graph
• The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
• Regular line-symmetric graphs
• An Edge but not Vertex Transitive Cubic Graph^*
• Self-dual configurations and regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Links between two semisymmetric graphs on 112 vertices via association schemes