Math help in Numerical Analysis, Systems of Equations: Cholesky, LU factorization, Consistence, Differential Equations (ODE), Euler's Method, Approximation of Integrals: Simpson's method, Partial Differential Equations (PDE), Symbolic Computations, Latex, Game Theory, Graph Theory; Relations, Equivalence, Implication, Boolean values, True, False, or, and, xor, Predicates, First Order Logic, Second Order Logic, Decidability, Turing machine, P problems, NP problems, Axioms, Axiom of Choice; Paradoxes: Russel, Banach-Tarski; Goedel's Incompleteness Theorem, Foundations of Mathematics on My Math Forum.Math problems on Numerical Series Geometry Other Topics
I want to show the following:
Assume simple graphs.
If G is a graph of order n such that
, then the edge-connectivity
of G is equal to
So I can show that G is connected and that it is not a tree since it cannot
contain end-vertices(vertices of degree 1) for any graph where n > 2.
I'm not sure what would be the best way to proceed, having difficulty showing
- Posts: 13
- Joined: Sat Jun 30, 2012 9:24 am
Return to Applied Mathematics, Set Theory, Logics and other
Who is online
Users browsing this forum: No registered users and 3 guests