- Tytuł:
- End Simplicial Vertices in Path Graphs
- Autorzy:
-
Gutierrez, Marisa
Tondato, Silvia B. - Powiązania:
- https://bibliotekanauki.pl/articles/31340940.pdf
- Data publikacji:
- 2016-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
chordal graphs
clique trees
path graphs - Opis:
- A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV -model that is a path, called an interval model. Gimbel [3] characterized those vertices in interval graphs for which there is some interval model where the interval corresponding to those vertices is an end interval. In this work, we give a characterization of those simplicial vertices x in path graphs for which there is some UV -model where the maximal clique containing x is a leaf in this UV -model.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2016, 36, 2; 393-408
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł