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
β¦ LIBER β¦
Distance graphs onRnwith 1-norm
β Scribed by Jer-Jeong Chen; Gerard J. Chang
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 265 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Orientation distance graphs
β
Gary Chartrand; David Erwin; Michael Raines; Ping Zhang
π
Article
π
2001
π
John Wiley and Sons
π
English
β 194 KB
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
Norm-Graphs: Variations and Applications
β
Noga Alon; Lajos RΓ³nyai; Tibor SzabΓ³
π
Article
π
1999
π
Elsevier Science
π
English
β 119 KB
Distance-regularised graphs are distance
β
Chris D Godsil; John Shawe-Taylor
π
Article
π
1987
π
Elsevier Science
π
English
β 506 KB
On distance regular graphs with ci=b1
β
E.W. Lambeck
π
Article
π
1993
π
Elsevier Science
π
English
β 156 KB
Lambeck, E-W., On distance regular graphs with c, = b,, Discrete Mathematics I 13 (1993)