| Display title | Distance-hereditary graph |
| Default sort key | Distance-hereditary graph |
| Page length (in bytes) | 19,526 |
| Namespace ID | 0 |
| Page ID | 239582 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiGary |
| Date of page creation | 21:06, 6 March 2023 |
| Latest editor | imported>WikiGary |
| Date of latest edit | 21:06, 6 March 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In graph theory, a branch of discrete 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... |
