Matches in SemOpenAlex for { <https://semopenalex.org/work/W173255084> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W173255084 abstract "regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or non-adjacent. From an algebraic point of view, a graph is strongly regular if its adjacency matrix has exactly three eigenvalues. regular graphs have very interesting algebraic properties due to their strong regularity conditions. Many strongly regular graphs are known to have large and interesting automorphism groups [23]. In [23] it is also conjectured that almost all strongly regular graphs are asymmetric. Peter Cameron in [7] mentions that Strongly regular graphs lie on the cusp between highly structured and unstructured. Although strongly regular graphs have been studied extensively since they were introduced, there is very little known about the automorphism group of an arbitrary strongly regular graph based on its parameters. In this thesis, we have developed theory for studying the automorphisms of strongly regular graphs. Our study is both mathematical and computational. On the computational side, we introduce the notion of orbit matrices. Using these matrices, we were able to show that some strongly regular graphs do not admit an automorphism of a certain order. Given the size of the automorphism, we can generate all of the orbit matrices, using a computer program. Another computer program is implemented that generates all the strongly regular graphs from that orbit matrix.From a mathematical point of view, we have found an upper bound on the number of fixed points of the automorphisms of a strongly regular graph. This upper bound is a new upper bound and is obtained by algebraic techniques." @default.
- W173255084 created "2016-06-24" @default.
- W173255084 creator A5040119665 @default.
- W173255084 date "2009-01-01" @default.
- W173255084 modified "2023-09-23" @default.
- W173255084 title "On strongly regular graphs" @default.
- W173255084 cites W1977004736 @default.
- W173255084 cites W2005234139 @default.
- W173255084 cites W2022491233 @default.
- W173255084 cites W2023290000 @default.
- W173255084 cites W2751728145 @default.
- W173255084 hasPublicationYear "2009" @default.
- W173255084 type Work @default.
- W173255084 sameAs 173255084 @default.
- W173255084 citedByCount "2" @default.
- W173255084 countsByYear W1732550842018 @default.
- W173255084 countsByYear W1732550842020 @default.
- W173255084 crossrefType "dissertation" @default.
- W173255084 hasAuthorship W173255084A5040119665 @default.
- W173255084 hasConcept C114614502 @default.
- W173255084 hasConcept C118615104 @default.
- W173255084 hasConcept C118712358 @default.
- W173255084 hasConcept C123482549 @default.
- W173255084 hasConcept C132525143 @default.
- W173255084 hasConcept C133875400 @default.
- W173255084 hasConcept C134306372 @default.
- W173255084 hasConcept C14201764 @default.
- W173255084 hasConcept C149530733 @default.
- W173255084 hasConcept C160446614 @default.
- W173255084 hasConcept C180356752 @default.
- W173255084 hasConcept C203776342 @default.
- W173255084 hasConcept C22149727 @default.
- W173255084 hasConcept C33923547 @default.
- W173255084 hasConcept C43517604 @default.
- W173255084 hasConcept C56654003 @default.
- W173255084 hasConcept C6049932 @default.
- W173255084 hasConcept C74133993 @default.
- W173255084 hasConcept C77553402 @default.
- W173255084 hasConceptScore W173255084C114614502 @default.
- W173255084 hasConceptScore W173255084C118615104 @default.
- W173255084 hasConceptScore W173255084C118712358 @default.
- W173255084 hasConceptScore W173255084C123482549 @default.
- W173255084 hasConceptScore W173255084C132525143 @default.
- W173255084 hasConceptScore W173255084C133875400 @default.
- W173255084 hasConceptScore W173255084C134306372 @default.
- W173255084 hasConceptScore W173255084C14201764 @default.
- W173255084 hasConceptScore W173255084C149530733 @default.
- W173255084 hasConceptScore W173255084C160446614 @default.
- W173255084 hasConceptScore W173255084C180356752 @default.
- W173255084 hasConceptScore W173255084C203776342 @default.
- W173255084 hasConceptScore W173255084C22149727 @default.
- W173255084 hasConceptScore W173255084C33923547 @default.
- W173255084 hasConceptScore W173255084C43517604 @default.
- W173255084 hasConceptScore W173255084C56654003 @default.
- W173255084 hasConceptScore W173255084C6049932 @default.
- W173255084 hasConceptScore W173255084C74133993 @default.
- W173255084 hasConceptScore W173255084C77553402 @default.
- W173255084 hasOpenAccess W173255084 @default.
- W173255084 hasRelatedWork W1942887994 @default.
- W173255084 hasRelatedWork W2002722515 @default.
- W173255084 hasRelatedWork W2073668070 @default.
- W173255084 hasRelatedWork W2077744016 @default.
- W173255084 hasRelatedWork W2127582285 @default.
- W173255084 hasRelatedWork W2129475053 @default.
- W173255084 hasRelatedWork W2132686894 @default.
- W173255084 hasRelatedWork W2138569482 @default.
- W173255084 hasRelatedWork W2223829988 @default.
- W173255084 hasRelatedWork W2240994780 @default.
- W173255084 hasRelatedWork W2461134002 @default.
- W173255084 hasRelatedWork W2487735453 @default.
- W173255084 hasRelatedWork W2741421175 @default.
- W173255084 hasRelatedWork W2810278013 @default.
- W173255084 hasRelatedWork W2896767743 @default.
- W173255084 hasRelatedWork W294731568 @default.
- W173255084 hasRelatedWork W2998972615 @default.
- W173255084 hasRelatedWork W3088426398 @default.
- W173255084 hasRelatedWork W68609794 @default.
- W173255084 hasRelatedWork W768096598 @default.
- W173255084 isParatext "false" @default.
- W173255084 isRetracted "false" @default.
- W173255084 magId "173255084" @default.
- W173255084 workType "dissertation" @default.