Floor function proof
Not what you're looking for?
Assume that G does not equal K_2.
K_2 is the complete 2-partite graph
If G is regular of degree "r" and Kappa(G) = 1, prove that λ(G) <= [floor function of "r / 2" ]
The floor function, also called the greatest integer function or integer value, gives the largest integer less than or equal to "r / 2."
DEFN: the connectivity, Kappa(G), of a graph G is the minimum number of vertices whose removal makes G disconnected, or trival.
DEFN: the edge connectivity, λ(G), is the minimum number of edges whose removal makes G disconnected or trival.
Purchase this Solution
Solution Summary
This is a proof regarding a floor function. The greatest integer function or integer value is determined for connectivity.
Solution Preview
Without loss of generality, we can assume that the graph is connected. Now, K_2 is the only 1-regular graph (graph of regularity 1). Hence we have G r-regular with r >= 2.
Consider any graph such that Kappa(G) = 1. By definition of Kappa, there ...
Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
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.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.