On upper traceable numbers of graphs
Futaba Okamoto, Ping Zhang (2008)
Mathematica Bohemica
Similarity:
For a connected graph of order and a linear ordering of vertices of , , where is the distance between and . The upper traceable number of is , where the maximum is taken over all linear orderings of vertices of . It is known that if is a tree of order , then and if . All pairs for which there exists a tree of order and are determined and a characterization of all those trees of order with upper traceable number is established. For a connected...