Mathematics Homework Solutions
Problem
#128933

Trees and Graphs : Vertices and Edges

1. True or False. It is possible to obtain a graph in which the number of vertices is 9, each with degree 5.

2. How many edges are there in a tree with 14 vertices? Choose one answer.
(a) 10 (b) 13 (c) 14 (d) 15 (e) none of the above

3. If there 5 sections of Discrete Math with a total enrollment of 31 students, what is the smallest possible number of students in the section with the largest enrollment?





Solution Summary

Trees and Graphs, Vertices and Edges 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
What is this?
By OTA - Overall OTA Rating
Purchase Cost Now
$2.19 CAD (was ~$11.97)
Included in Download
  • Plain text response
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Trees, Graphs and Multigraphs - By contracting an edge e = uv, we mean removing e and identifying the vertices u and v as a single new vertex. Let num_T(G) denote the number of spanning trees of the graph G. a. Show that the follow ...
  • Trees and Incidence Matrices - Let G be a graph with p vertices and p-1 edges. Prove that G is a tree iff any p-1 rows of the incidence matrix are linearly independent over Z/(2) (integers modulo 2).
  • Mean and Standard Deviation - Height of 50 oak trees were measured, but due to problems only partial results were obtained. it was found that 6 trees had a height of less than 9 metres, while 18 trees had a height of less than 15 ...
  • Directed Graphs and Trees - a. Is a directed graph weakly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph? b. If two trees have the same number of vertices and the same deg ...
  • Draw the splitting and merging trees obtained during sorting of given sequence of numbers using merge sort. - Sort the given sequence of numbers using merge sort. Draw the splitting and merging trees for each application of the procedure. -1, 0, 2, -2, 3, 6, -3, 5, 1, 4
Browse