Strongly regular graph proof
Not what you're looking for?
Let n >= 2 be a number. Define the graph L2(n) as follows: Vertices are ordered pairs from the set {1, ..., n}. Two vertices are adjacent if they have the same first coordinate, or the same second coordinate (but not both).
Show that this is a strongly regular graph, and find its parameters.
Purchase this Solution
Solution Summary
This is a proof regarding a strongly regular graph.
Solution Preview
First, each node of this graph L2(n) is an ordered pair (a,b), where a,b
are selected from the set X={1,2,...,n}. Each a or b has n choices. Thus
the graph has v=n^2 nodes.
Second, I claim that this is a k-regular graph, where k=2(n-1).
For each node (a,b), it has neighbors (a,r), ...
Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.