Two-step graphs of trees (Q688263)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-step graphs of trees |
scientific article; zbMATH DE number 444646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-step graphs of trees |
scientific article; zbMATH DE number 444646 |
Statements
Two-step graphs of trees (English)
0 references
9 June 1994
0 references
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.
0 references
trees
0 references
competition graphs
0 references
interval graph
0 references
two-step graph
0 references
0.8713647723197937
0 references
0.8394565582275391
0 references
0.8268051743507385
0 references
