The center and the distance center of a Ptolemaic graph (Q1112843)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The center and the distance center of a Ptolemaic graph |
scientific article; zbMATH DE number 4079475
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The center and the distance center of a Ptolemaic graph |
scientific article; zbMATH DE number 4079475 |
Statements
The center and the distance center of a Ptolemaic graph (English)
0 references
1988
0 references
A connected graph \(G=(V,X)\) is Ptolemaic if, and only if, it is chordal and every 5-cycle has at least three chords. A graph \(G=(V,E)\) is chordal if, and only if, every cycle of at least four lines contains a chord. The author proves some interesting properties of Ptolemaic and chordal graphs using concepts as distance center, simplicial point and maximal distance.
0 references
Ptolemaic graphs
0 references
chordal graphs
0 references
