Distance monotone graphs and a new characterization of hypercubes
โ Scribed by Gustav Burosch; Ivan Havel; Jean-Marie Laborde
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 491 KB
- Volume
- 110
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Burosch, G., I. Have1 and J.-M. Laborde, Distance monotone graphs and a new characterization of hypercubes, Discrete Mathematics 110 (1992) 9-16.
๐ SIMILAR VOLUMES
Let G be a connected graph and S โ V (G). Then, the Steiner distance of S in G, denoted by d G (S), is the smallest number of edges in a connected subgraph of G that contains . Some general properties about the cycle structure of k-Steiner distance hereditary graphs are established. These are then
A graph is Hilbertian if for any three vertices u, v and w, the interval I(u, u) contains a unique nearest vertex p from w. We show that a graph is median if and only if it is Hilbertian.
One of the first characterizations of interval graphs, given by Lekkerkerker and Boland (1962), uses the concept of an asteroidal triple. In this paper we give a similar characterization on the proper interval graphs using the akin concept of an astral triple.