Two-step graphs of trees
Two-steps graphs (see the review Zbl 0790.05036 below) of trees are examined in two contexts. First, they are considered as competition graphs, and necessary and sufficient conditions are given for the competition graph of a tree to be an interval graph. Then, the problem of constructing the tree \(T\) from its two-step graph \(S_ 2(T)\) is considered. A class of trees where this is possible is found.
scientific article; zbMATH DE number 444646
scientific article