Ptolemaic graph
id:
ptolemaic-graph-288-1496886
title:
Ptolemaic graph
text:
In graph theory, a Ptolemaic graph is an undirected graph whose shortest path distances obey Ptolemy's inequality, which in turn was named after the Greek astronomer and mathematician Ptolemy. The Ptolemaic graphs are exactly the graphs that are both chordal and distance-hereditary; they include the block graphs and are a subclass of the perfect graphs.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Ptolemaic_graph
date created:
date modified:
2023-08-18T23:22:08Z
main entity:
{"identifier":"Q24884155","url":"https://www.wikidata.org/entity/Q24884155"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/39/Identity_graph2.svg","width":256,"height":256}
fields total:
13
integrity:
14