On automorphisms of semitriangular graphs with \(\mu = 7\)
type: Item
instance of: scholarly article
title: On automorphisms of semitriangular graphs with \(\mu = 7\)
zbMATH Open document ID: 1243.05170
DOI: 10.1134/S1064562411040077
published in: Doklady Mathematics
publication date: 2012-01-17T00:00:00Z
review text: The authors consider automorphisms of semitriangular graphs with \(\mu =7\). Graphs are strongly regular graphs with parameters \((v,k,\lambda,\mu)\) if \(v\) is their number of vertices, they are regular graphs of degree \(k\), each of their edges lies in exactly \(\lambda\) triangles and for any two vertices \(a\) and \(b\), \(\mu(a,b)\) is \(\left|\left[a\right] \cap \left[b\right]\right|\), where \(\left[a\right]\) and \(\left[b\right]\) denote the neighborhoods of two nonadjacent vertices \(a\) and \(b\). For strong regular graphs \(\mu (a,b)\) does not depend \(a\) and \(b\). The authors find possible automorphisms of semitriangular graph with \(\mu =7\) and subgraphs of their fixed points.
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 5998434
zbMATH Keywords: strongly regular graph
zbMATH Keywords: automorphism: semitriangular graph
author: Natal'ya Dmitrievna Zyulyarkina
author: Alexandre A. Makhnev
MaRDI profile type: Publication
cites work: Characterization of families of rank 3 permutation groups by the subdegrees. I
cites work: Automorphisms of semitriangular graphs with \(\mu = 6\)
cites work: Q4231664
cites work: On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
description: scientific article; zbMATH DE number 5998434