Changes between Initial Version and Version 1 of Ticket #16370, comment 21
 Timestamp:
 06/04/14 09:07:02 (7 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #16370, comment 21
initial v1 5 5  Adjacency graph: the points are the vertices; two vertices are adjacent if they are incident in a common line. 6 6 7  Block Intersection graph: the vertices are blocks of the system and two vertices are adjacent if they meet in some number of points.7  Block Intersection graph: the vertices are lines of the system and two vertices are adjacent if they meet in some fixed condition on the number of points. 8 8 9 9 As I indicated above, it is common to call the graphs that we are talking about as Block intersection graphs. 10 10 11 A quasisymmetric design is a 2design with atmost two block intersection numbers. Those with only one block intersection number are the square (or symmetric) 2designs. One can solve the equations one obtains by using Fischer's variance counting to get the parametersin this case.11 A quasisymmetric design is a 2design with atmost two block intersection numbers. Those q.s designs with only one block intersection number are the square (or symmetric) 2designs. One can solve the equations one obtains by using Fischer's variance counting to get the parameters of the SRG in this case. 12 12 13 13 Curiously, petersen graph is the block intersection graph of the 2design 2(6, 3, 2) (this is a quasisymmetric design: any two blocks meet in 0 points or 1 point) where you define adjacency among blocks as "being disjoint". See [http://sina.sharif.edu/~emahmood/papers/MR1147979.PDF here].