Graph similarity and distance in graphs
β Scribed by G. Chartrand; G. Kubicki; M. Schultz
- Book ID
- 105752315
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Weight
- 427 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0001-9054
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For two nonisomorphic orientations D and D H of a graph G, the orientation distance d o (D,D H ) between D and D H is the minimum number of arcs of D whose directions must be reversed to produce an orientation isomorphic to D H . The orientation distance graph h o (G) of G has the set y(G) of pairwi
Suppose D is a subset of all positive integers. The distance graph G(Z, D) with distance set D is the graph with vertex set Z, and two vertices x and y are adjacent if and only if |x -y| β D. This paper studies the chromatic number Ο(Z, D) of G(Z, D). In particular, we prove that Ο(Z, D) β€ |D| + 1 w
Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i