- Tytuł:
- The i-chords of cycles and paths
- Autorzy:
- McKee, Terry
- Powiązania:
- https://bibliotekanauki.pl/articles/743264.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
chord
chordal graph
strongly chordal graph
ptolemaic graph
trivially perfect graph
threshold graph - Opis:
- An i-chord of a cycle or path is an edge whose endpoints are a distance i ≥ 2 apart along the cycle or path. Motivated by many standard graph classes being describable by the existence of chords, we investigate what happens when i-chords are required for specific values of i. Results include the following: A graph is strongly chordal if and only if, for i ∈ {4,6}, every cycle C with |V(C)| ≥ i has an (i/2)-chord. A graph is a threshold graph if and only if, for i ∈ {4,5}, every path P with |V(P)| ≥ i has an (i -2)-chord.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 4; 607-615
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł