End Simplicial Vertices in Path Graphs

• Autorzy: Marisa Gutierrez , Silvia B. Tondato
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

chordal graphs; clique trees; path graphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 2
• Strony: 393-408

Daty

wydano

2016-05-01

otrzymano

2013-11-28

poprawiono

2015-07-17

zaakceptowano

2015-07-17

online

2016-04-15

Twórcy

autor

Marisa Gutierrez

• Conicet Departamento de Matemática, Facultad de Ciencias Exactas Universidad Nacional de La Plata, Argentina

autor

Silvia B. Tondato

• Departamento de Matemática, Facultad de Ciencias Exactas Universidad Nacional de La Plata, Argentina

Identyfikatory

DOI

10.7151/dmgt.1866