Links between two semisymmetric graphs on 112 vertices via association schemes
type: Item
instance of: scholarly article
title: Links between two semisymmetric graphs on 112 vertices via association schemes
zbMATH Open document ID: 1244.05235
author: Josef Lauri
author: Matan Ziv-Av
author: Mikhail H. Klin
published in: Journal of Symbolic Computation
publication date: 2012-07-04T00:00:00Z
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6053100
zbMATH Keywords: Nikolaev graph
zbMATH Keywords: dejter graph
zbMATH Keywords: semisymmetric graph
zbMATH Keywords: Ljubljana graph
zbMATH Keywords: double cover
zbMATH Keywords: association scheme
zbMATH Keywords: computer algebra
zbMATH Keywords: deza graph
zbMATH Keywords: overlarge set of designs
describes a project that uses: GRAPE
describes a project that uses: nauty
describes a project that uses: GAP
MaRDI profile type: Publication
full work available at URL: j.jsc.2011.12.040
OpenAlex ID: W2023580423
cites work: Q4263939
cites work: Q3218140
cites work: Q3859994
cites work: Q4874598
cites work: An Edge but not Vertex Transitive Cubic Graph*
cites work: Q3992965
cites work: Some new strongly regular graphs
cites work: Highly symmetric subgraphs of hypercubes
cites work: Q4664539
cites work: Q3745851
cites work: The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
cites work: A census of semisymmetric cubic graphs on up to 768 vertices
cites work: Self-dual configurations and regular graphs
cites work: On symmetric subgraphs of the 7-cube: An overview
cites work: Q4221873
cites work: Q3976612
cites work: Q4390709
cites work: Q4301884
cites work: Q4309968
cites work: Q4882944
cites work: Deza graphs: A generalization of strongly regular graph
cites work: Galois correspondence between permutation groups and cellular rings (association schemes)
cites work: Q4237398
cites work: Q4284633
cites work: Regular line-symmetric graphs
cites work: Q2716030
cites work: Parallel concepts in graph theory
cites work: Coherent configurations. I
cites work: Coherent algebras
cites work: Rank 5 association schemes and triality
cites work: A graph which is edge transitive but not arc transitive
cites work: Q4284641
cites work: Q3487414
cites work: Q3765805
cites work: Q3331393
cites work: Q3931423
cites work: Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
cites work: Higmanian rank-5 association schemes on 40 points
cites work: Q3656462
cites work: Examples of computer experimentation in algebraic combinatorics
cites work: Q4039780
cites work: Q5710205
cites work: Q3090474
cites work: Q4414312
cites work: The Gray graph revisited
cites work: A characterization of particular symmetric (0,1) matrices
cites work: Q4735197
cites work: Q5617749
cites work: Q4273617
cites work: Q5650705
cites work: Q3941454
cites work: Double covers and logics of graphs

Links between two semisymmetric graphs on 112 vertices via association schemes (cites work)
cites work: Links between two semisymmetric graphs on 112 vertices via association schemes

Links between two semisymmetric graphs on 112 vertices via association schemes (DOI)
DOI: 10.1016/J.JSC.2011.12.040

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: THE CLASSIFICATION OF ASSOCIATION SCHEMES WITH 11 OR 12 VERTICES
Similarity Score: 0.875671
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: On symmetric association schemes and associated quotient-polynomial graphs
Similarity Score: 0.8591076
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: On the connectivity of graphs in association schemes
Similarity Score: 0.84811217
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: Q5460919
Similarity Score: 0.846217
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: Q3815328
Similarity Score: 0.8428636
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: Q4217796
Similarity Score: 0.84280527
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: Linking rings structures and semisymmetric graphs: Combinatorial constructions
Similarity Score: 0.83104545
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: Note on semi-linkage with almost prescribed lengths in large graphs
Similarity Score: 0.8305825
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: Some semisymmetric graphs arising from finite vector spaces
Similarity Score: 0.82690823
Recommender Run: Recommender Run 3

Links between two semisymmetric graphs on 112 vertices via association schemes (Recommended article)
Recommended article: Semisymmetry of generalized Folkman graphs
Similarity Score: 0.8261337
Recommender Run: Recommender Run 3