AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}
Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with \(\lambda=\mu\). They proposed the program of investigation vertex-symmetric antipodal distance-...
Main Authors: | Konstantin S. Efimov, Alexander A. Makhnev |
---|---|
Format: | Article |
Language: | English |
Published: |
Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin.
2017-07-01
|
Series: | Ural Mathematical Journal |
Subjects: | |
Online Access: | https://umjuran.ru/index.php/umj/article/view/79 |
Similar Items
-
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
by: Konstantin S. Efimov, et al.
Published: (2018-12-01) -
DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST
by: Konstantin S. Efimov, et al.
Published: (2020-12-01) -
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125}
by: V.V. Bitkina, et al.
Published: (2017-03-01) -
D-magic strongly regular graphs
by: Rinovia Simanjuntak, et al.
Published: (2020-09-01) -
Enumeration of Strongly Regular Graphs on up to 50 Vertices Having S3 as an Automorphism Group
by: Marija Maksimović
Published: (2018-06-01)