End simplicial vertices in path graphs | Zendy

Marisa Gutiérrez | Zendy; Silvia Tondato | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

End simplicial vertices in path graphs

Author(s) -

Marisa Gutiérrez,

Silvia Tondato

Publication year - 2016

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1866

Subject(s) - mathematics , combinatorics , path (computing) , discrete mathematics , computer science , programming language

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research