Distance-hereditary graph
id:
distance-hereditary-graph-199-5392252
title:
Distance-hereditary graph
text:
In graph theory, a branch of discrete mathematics, a distance-hereditary graph is a graph in which the distances in any connected induced subgraph are the same as they are in the original graph. Thus, any induced subgraph inherits the distances of the larger graph. Distance-hereditary graphs were named and first studied by Howorka (1977), although an equivalent class of graphs was already shown to be perfect in 1970 by Olaru and Sachs. It has been known for some time that the distance-hereditary
brand slug:
wiki
category slug:
encyclopedia
description:
Graph whose induced subgraphs preserve distance
original url:
https://en.wikipedia.org/wiki/Distance-hereditary_graph
date created:
date modified:
2022-10-01T22:06:08Z
main entity:
{"identifier":"Q5282847","url":"https://www.wikidata.org/entity/Q5282847"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d1/Distance-hereditary_graph.svg","width":252,"height":216}
fields total:
13
integrity:
15