On constructing regular distance-preserving graphs
From MaRDI portal
Abstract: Let G be a simple, connected graph on n vertices. Let d_G(u,v) denote the distance between vertices u and v in G. A subgraph H of G is isometric if d_H(u,v)=d_G(u,v) for every u,v in V(H). We say that G is a distance-preserving graph if G contains at least one isometric subgraph of order k for every k, 1le kle n. In this paper we construct regular distance-preserving graphs of all possible orders and degrees of regularity. By modifying the Havel-Hakimi algorithm, we are able to construct distance preserving graphs for certain other degree sequences as well. We include a discussion of some related conjectures which we have computationally verified for small values of n.
Recommendations
Cited in
(12)- Greedy construction of nearly regular graphs
- On distance-preserving elimination orderings in graphs: complexity and algorithms
- Retracing argument for distance-regular graphs
- Modular decomposition of graphs and the distance preserving property
- Variants of k-regular nearest neighbor graph and their construction
- Preliminary results on distance-preserving graphs
- Distance preserving Ramsey graphs
- Distance preserving graphs and graph products.
- Distance-Preserving Graph Contractions
- On a conjecture about the existence of isometric subgraphs
- Distance-Preserving Graph Contractions
- On distance preserving and sequentially distance preserving graphs
This page was built for publication: On constructing regular distance-preserving graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251988)
