Path-neigborhood graphs | Zendy

Renu Laskar | Zendy; Henry Martyn Mulder | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Path-neigborhood graphs

Author(s) -

Renu Laskar,

Henry Martyn Mulder

Publication year - 2013

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.1700

Subject(s) - combinatorics , mathematics , induced path , path graph , path (computing) , block graph , graph , distance hereditary graph , distance , longest path problem , discrete mathematics , graph power , pathwidth , line graph , chordal graph , shortest path problem , computer science , programming language

textabstractA path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized. The 3-sun is obtained from a 6-cycle by adding three chords between the three pairs of vertices at distance 2. A Pk -graph is a path-neighborhood graph in which every neighborhood is a Pk , where Pk is the path on k vertices. The Pk -graphs are characterized for k ≤ 4

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