Article ID Journal Published Year Pages File Type
6871197 Discrete Applied Mathematics 2018 14 Pages PDF
Abstract
For every connected graph G, a subgraph H of G is isometric if the distance between any two vertices in H is the same in H as in G. A distance-preserving elimination ordering of G is a total ordering of its vertex-set V(G), denoted (v1,v2,…,vn), such that any subgraph Gi=G∖(v1,v2,…,vi) with 1≤i
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , ,