𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Graph similarity and distance in graphs
✍ G. Chartrand; G. Kubicki; M. Schultz πŸ“‚ Article πŸ“… 1998 πŸ› Springer 🌐 English βš– 427 KB
Local extrema in genus-stratified graphs
✍ Jonathan L. Gross; Robert G. Rieper πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 663 KB
Orientation distance graphs
✍ Gary Chartrand; David Erwin; Michael Raines; Ping Zhang πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 194 KB

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

Integral distance graphs
✍ Chen, Jer-Jeong; Chang, Gerard J.; Huang, Kuo-Ching πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 90 KB

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

Distance-Balanced Graphs
✍ Janja Jerebic; Sandi KlavΕΎar; Douglas F. Rall πŸ“‚ Article πŸ“… 2008 πŸ› Springer 🌐 English βš– 195 KB