Exponential Inequalities over the Parameters of a Strongly Regular Graph

Author(s):  
Luís Almeida Vieira ◽  
Vasco Moço Mano
2021 ◽  
Vol 180 ◽  
pp. 105424
Author(s):  
Joshua E. Ducey ◽  
David L. Duncan ◽  
Wesley J. Engelbrecht ◽  
Jawahar V. Madan ◽  
Eric Piato ◽  
...  

2013 ◽  
Vol 5 (1) ◽  
pp. 13
Author(s):  
Rizki Mulyani ◽  
Triyani Triyani ◽  
Niken Larasati

This article studied spectrum of strongly regular graph. This spectrum can be determined by the number of walk with lenght l on connected simple graph, equation of square adjacency matrix and eigen value of strongly regular graph.


Author(s):  
Andriy Bondarenko ◽  
Anton Mellit ◽  
Andriy Prymak ◽  
Danylo Radchenko ◽  
Maryna Viazovska

1977 ◽  
Vol 29 (4) ◽  
pp. 845-847 ◽  
Author(s):  
M. D. Atkinson

In this paper we shall consider certain rank 3 permutation groups G which act on a set Ω of size n. Thus a point stabiliser Gα will have 3 orbits { α }, △ (α), Γ (α) of sizes 1, k, I respectively. It is well known that, if |G| is even, then the orbital △ defines a strongly regular graph on Ω. In this graph, every point has valency k, every pair of adjacent points are adjacent to a constant number λ of common points, and every pair of non-adjacent points are adjacent to a constant number μ of common points. This notation is reasonably standard (see [4], where much background theory is given).


Sign in / Sign up

Export Citation Format

Share Document