Distance in stratified graphs
β Scribed by Gary Chartrand; Lisa Hansen; Reza Rashidi; Naveed Sherwani
- Book ID
- 110419887
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 536 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0011-4642
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