answersLogoWhite

0

A tree in which one vertex called the root, is distinguished from all the others is called a rooted tree.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

How many nodes are in a family branch tree in graph theory?

In Mathematics and Computer Science, the graph theory is just the theory of graphs basically overall. It's basically the relationship between objects. The nodes are just lines that connects the graph. There are a total of six nodes in a family branch tree for a graph theory basically.


What is spaning tree in c programming?

Nothing, but it has significance in graph-theory.


What has the author Gregory Lawrence Chesson written?

Gregory Lawrence Chesson has written: 'Synthesis techniques for transformations on tree and graph structures' -- subject(s): Data structures (Computer science), Graph theory, Trees (Graph theory)


When was Deep Rooted Tree created?

Deep Rooted Tree was created on 2011-10-05.


When did Deep Rooted Tree end?

Deep Rooted Tree ended on 2011-12-22.


Can the seed from a mahogany tree be rooted?

It cannot be rooted but it can by sprouted.


The group of a composite graph?

defines in graph theory defines in graph theory


What is the difference between a minimum spanning tree and a shortest path in graph theory?

In graph theory, a minimum spanning tree is a tree that connects all the vertices of a graph with the minimum possible total edge weight, while a shortest path is the path with the minimum total weight between two specific vertices in a graph. In essence, a minimum spanning tree focuses on connecting all vertices with the least total weight, while a shortest path focuses on finding the path with the least weight between two specific vertices.


Is every tree a graph or every graph a tree?

true


Is every tree a bipartite graph?

Yes, every tree ia a bipartite graph (just see wikipedia).


When was Journal of Graph Theory created?

Journal of Graph Theory was created in 1977.


What is Difference between tree and spanning tree?

A tree is a connected graph in which only 1 path exist between any two vertices of the graph i.e. if the graph has no cycles. A spanning tree of a connected graph G is a tree which includes all the vertices of the graph G.There can be more than one spanning tree for a connected graph G.