Mathematics – Combinatorics
Scientific paper
2011-06-05
Mathematics
Combinatorics
15 pages
Scientific paper
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many possibilities for c, given a and e, and the standard divisibility conditions can be used to reduce the possibilities further. Many sets of feasible parameters appear to be accidents of arithmetic, but in some cases the conditions are satisfied for algebraic reasons. As an example, we discuss an infinite family of feasible parameters for which the corresponding graphs necessarily have a closed neighborhood as a star complement for e.
No associations
LandOfFree
Some Properties of Strongly Regular Graphs 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 Some Properties of Strongly Regular Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Properties of Strongly Regular Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-307332