Purchase Solution

Cycles, Sharpness and Upper Bound

Not what you're looking for?

Ask Custom Question

Let k>=3 be an integer , and let G be a plane graph of order n(>=k) and size m.
a) If the length of every cycle is at least k, then determine an upper bound B for m in terms of n and k.

b)Show that the bound B obtained in a) is sharp by determining for arbitrary k>=3, a plane graph G of order n and size B, every cycle of which has length at least k.

Purchase this Solution
Solution Summary

Cycles, Sharpness and Upper Bound are investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

Solution provided by:
Changping Wang, MA
Education
  • BSc , Wuhan Univ. China
  • MA, Shandong Univ.
Recent Feedback
  • "Your solution, looks excellent. I recognize things from previous chapters. I have seen the standard deviation formula you used to get 5.154. I do understand the Central Limit Theorem needs the sample size (n) to be greater than 30, we have 100. I do understand the sample mean(s) of the population will follow a normal distribution, and that CLT states the sample mean of population is the population (mean), we have 143.74. But when and WHY do we use the standard deviation formula where you got 5.154. WHEN & Why use standard deviation of the sample mean. I don't understand, why don't we simply use the "100" I understand that standard deviation is the square root of variance. I do understand that the variance is the square of the differences of each sample data value minus the mean. But somehow, why not use 100, why use standard deviation of sample mean? Please help explain."
  • "excellent work"
  • "Thank you so much for all of your help!!! I will be posting another assignment. Please let me know (once posted), if the credits I'm offering is enough or you ! Thanks again!"
  • "Thank you"
  • "Thank you very much for your valuable time and assistance!"
Purchase this Solution
Free BrainMass Quizzes
Change and Resistance within Organizations

This quiz intended to help students understand change and resistance in organizations

MS Word 2010-Tricky Features

These questions are based on features of the previous word versions that were easy to figure out, but now seem more hidden to me.

Social Media: Pinterest

This quiz introduces basic concepts of Pinterest social media

Cost Concepts: Analyzing Costs in Managerial Accounting

This quiz gives students the opportunity to assess their knowledge of cost concepts used in managerial accounting such as opportunity costs, marginal costs, relevant costs and the benefits and relationships that derive from them.

Situational Leadership

This quiz will help you better understand Situational Leadership and its theories.

View More Free Quizzes
Related BrainMass Solutions

  • Sharpness of a Bound

    In this solution, sharpness is investigated and the sharpness of the bound in question a) is given.

  • Graph Theory : Connected Graphs and Disconnected Graphs

    The sharpness of a bound is the derivative of the bound. Problem #1 (a) Proof: We use mathematical induction. If the graph has only one node, then it is already connected. If n =2 , the graph has two nodes, say u and v.

  • Real Analysis : Bounded Sets

    So is an upper bound of and is a lower bound of . Thus is both upper bounded and lower bounded by Definition 2 and Definition 3.

  • Follow the example and use the least upper bound property of the real numbers to prove that any positive real number has a cube root.

    < x For the case y2 > x, let ε = (y - ε)2 >=x  y- ε is also an upper bound for S Thus y is not the least upper bound and y2 !

  • Confidence Interval Questions

    Compute a 95% confidence interval for when n = 25 and xbar = 55.4 What is the lower bound? Give answer to three decimal places Compute a 95% confidence interval for when n = 25 and xbar = 55.4 What is the upper bound?

  • Determine Upper and Lower Bounds

    402966 Determine Upper and Lower Bounds Five sequences are given. The problem is to determine if each has a lower bound and if each has an upper bound.

  • Heine-Borel Theorem

    Since is bounded it has a least upper bound and a greatest lower bound. Let M be the least upper bound of and m be the greatest lower bound of It remains to show that and Let's show that If we're done.

  • Upper bounds of a non-empty set

    By the definition of an upper bound of a set, z is an upper bound of S. Since z < u, we see that z is an upper bound of S which is less than u, which contradicts (2).

  • Bounded Numbers

    Suppose is another upper bound of -A, then y , i.e., -x , and by multiplying (-1) to both sides of the inequality, we have x , which means that is a lower bound of A. But we already know that is the greatest lower bound of A.

View More Related Solutions