On strongly regular graphs with b 1 < 24

2013 ◽  
Vol 283 (S1) ◽  
pp. 111-118
Author(s):  
M. S. Nirova
2015 ◽  
Vol 92 (1) ◽  
pp. 482-486
Author(s):  
A. A. Makhnev ◽  
D. V. Paduchikh

2012 ◽  
Vol 119 (7) ◽  
pp. 1414-1426 ◽  
Author(s):  
Majid Behbahani ◽  
Clement Lam ◽  
Patric R.J. Östergård

2018 ◽  
Vol 34 (4) ◽  
pp. 711-726 ◽  
Author(s):  
Hermina Alajbegović ◽  
Almir Huskanović ◽  
Štefko Miklavič ◽  
Primož Šparl

10.37236/878 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Ralucca Gera ◽  
Jian Shen

The Friendship Theorem states that if any two people in a party have exactly one common friend, then there exists a politician who is a friend of everybody. In this paper, we generalize the Friendship Theorem. Let $\lambda$ be any nonnegative integer and $\mu$ be any positive integer. Suppose each pair of friends have exactly $\lambda$ common friends and each pair of strangers have exactly $\mu$ common friends in a party. The corresponding graph is a generalization of strongly regular graphs obtained by relaxing the regularity property on vertex degrees. We prove that either everyone has exactly the same number of friends or there exists a politician who is a friend of everybody. As an immediate consequence, this implies a recent conjecture by Limaye et. al.


Sign in / Sign up

Export Citation Format

Share Document