|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2013, Volume 10, Pages 22–30
(Mi semr390)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical logic, algebra and number theory
Edge-symmetric strongly regular graphs with at most 100 vertices
M. S. Nirova Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
Makhnev A.A. and Nirova M.S. remark that from 30 collections of parameters of unknown strongly regular graphs with at most 100 vertices only 11 can respond to edge-symmetric graphs. In this paper it is investigated the possible orders and the structures of subgraphs of the fixed points of automorphisms of strongly regular graph with parameters (100,33,8,12). It is proved that strongly regular graphs with parameters (100,33,8,12) and (100,66,44,42) are not edge-symmetric. As a corollary we have that a new edge-symmetric strongly regular graph with at most 100 vertices does not exist.
Keywords:
strongly regular graph, edge-symmetric graph.
Received December 15, 2012, published January 3, 2013
Citation:
M. S. Nirova, “Edge-symmetric strongly regular graphs with at most 100 vertices”, Sib. Èlektron. Mat. Izv., 10 (2013), 22–30
Linking options:
https://www.mathnet.ru/eng/semr390 https://www.mathnet.ru/eng/semr/v10/p22
|
Statistics & downloads: |
Abstract page: | 346 | Full-text PDF : | 72 | References: | 54 |
|