The center and the distance center of a Ptolemaic graph (Q1112843)

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.