RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sib. Èlektron. Mat. Izv., 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.

Full text: PDF file (494 kB)
References: PDF file   HTML file
UDC: 519.17+512.54
MSC: 05C25
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

Citation in format AMSBIB
\Bibitem{Nir13}
\by M.~S.~Nirova
\paper Edge-symmetric strongly regular graphs with at most 100 vertices
\jour Sib. \`Elektron. Mat. Izv.
\yr 2013
\vol 10
\pages 22--30
\mathnet{http://mi.mathnet.ru/semr390}


Linking options:
  • http://mi.mathnet.ru/eng/semr390
  • http://mi.mathnet.ru/eng/semr/v10/p22

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. K. S. Efimov, A. A. Makhnev, “Automorphisms of a distance-regular graph with intersection array $\{100,66,1;1,33,100\}$”, Sib. elektron. matem. izv., 12 (2015), 795–801  mathnet  crossref
  • Number of views:
    This page:210
    Full text:50
    References:35

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019