The distance d(G) of a connected graph G is the sum of the distances of all pairs of vertices of G. Let S be a connected graph. The sets In and Jn are defined so that I₁ = J₁ = {S}, and for n > 1 the ...
Compound graphs, a frequently encountered type of data set, have a hierarchical tree structure with parent-child relations (‘inclusion’ relations) and non-hierarchical relations between leaf nodes ...
Compound graphs, a frequently encountered type of data set, have a hierarchical tree structure with parent-child relations (‘inclusion’ relations) and non-hierarchical relations between leaf nodes ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback