Bipartite graphs with five eigenvalues and pseudo designs

Details Bipartite graphs with five eigenvalues and pseudo designs Bipartite graphs with five eigenvalues and pseudo designs

2009-05-17

arxiv.org/abs/0905.2740v3

Mathematics

Combinatorics

15pages, 6 figures. Final version. To appear in Journal of Algebraic Combinatorics

Scientific paper

10.1007/s10801-011-0331-3

A pseudo $(v,\, k,\, \la)$-design is a pair $(X, {\cal B})$ where $X$ is a $v$-set and ${\cal B}=\{B_1,...,B_{v-1}\}$ is a collection of $k$-subsets (blocks) of $X$ such that each two distinct $B_i, B_j$ intersect in $\la$ elements; and $0\le\la

Affiliated with

Also associated with

No associations

Rating

Bipartite graphs with five eigenvalues and pseudo designs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bipartite graphs with five eigenvalues and pseudo designs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite graphs with five eigenvalues and pseudo designs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514624