ブラウザの設定でJava Scriptの使用を有効にしてご利用ください。
出典:Wikipedia
出典:『Wikipedia』 (2011/05/19 13:39 UTC 版)
In graph-theoretic mathematics, a distance-hereditary graph (also called a completely separable 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 graph