Purchase Solution

Trees, Vertices and Edges

Not what you're looking for?

Ask Custom Question

Which one of these is correct and why?

If T is a tree with m vertices, how many edges does T have?
ans: m-1

or

If T is a tree with n vertices, how many edges does T have?
ans: n(n-1)/2

Purchase this Solution
Solution Summary

Trees, vertices and edges are investigated.

Solution Preview

If T is a tree with m vertices, T should have m-1 edges.

Proof:
Suppose the tree T has n levels, each level has a_k ...

Purchase this Solution
Free BrainMass Quizzes
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.

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.

View More Free Quizzes
Related BrainMass Solutions

  • Trees and Graphs: Does the Graph Exist?

    6988 Trees and Graphs: Does the Graph Exist? Graphs and trees Section 11.5, #16 Either draw a graph with the given specifications or explain why no such graph exists.

  • Trees and Graphs : Vertices and Edges

    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.

  • Graph Theory and Parse Tree

    With two vertices there is ONE edge, with three vertices there are THREE edges (e.g. three sides of the triangle), with four vertices there are SIX edges (e.g. four sided of the quadrilateral and the two diagonals), with five vertices there are TEN edges

  • Graceful Trees and Paths

    146472 Graceful Trees and Paths A (p,q) graph G is called graceful if it is possible to label the vertices of G with distinct elements from the set {0,1,...

  • Trees and Graphs

    If we contract one edge, 2 spanning trees remain in the remnant multi-graph made of two vertices connected by two edges. If however these 2 edges are identified to make a graph, this graph will only have one edge and so only 1 spanning tree.

  • Trees and Incidence Matrices

    146470 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).

  • Graphs, Digraphs, Trees and Forests

    Now consider the induced subgraph on the vertices. This graph will have all the edges of the cycle we are considering. Clearly all the vertices in this graph are on the cycle and have degree at least 2. There fore we have proved claim -- (2).

  • Graph

    Before considering each graph in turn, the two definitions we need for simple graphs and trees, we state as: Definition: simple graph A graph is simple when it has no loops and no two distinct edges have exactly the same pair of ends.

  • Relations and Graph Theory.

    Are there graphs with v vertices and v-1 edges that are no trees? Give a proof or justify your answer with a counterexample. Solution: There are such graphs.

View More Related Solutions