The diameter of a tree composed

Abstract EN

When graphs are used to model the linkage structure of communication networks, the diameter of the graph corresponds to the maximum number of links over which a message between two nodes must travel.Computing the diameter is basic algorithmic problems in computational geometry and graph theory having numerous applications in operation research, data clustering, and analysis of complex networks (social networks and the internet).

A tree is an connected under graph constituted upon all the vertices of graph and dues not certain any cycle.The diameter of a plane tree A is by definition the number of edges of the longest path in this tree A.

In this article we considerate the plan tree bicolored (two neighboring vertices are always indifferent colorings).We will introduce the composition of two plan tree bicolored A and B denoted by (A o B) and we interesse to calculate the diameter tree of the tree obtain by composition.