| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10328480 | Discrete Applied Mathematics | 2005 | 7 Pages |
Abstract
We prove three results conjectured or stated by Chartrand and Zhang [European J. Combin. 21 (2000) 181-189] and Chartrand et al. [Discrete Appl. Math. 116 (2002) 115-126; Internat. J. Math. Math. Sci. 36 (2003) 2265-2275]: a connected graph has orientations with different geodetic numbers, orientations with different hull numbers, and, if there are no end-vertices, orientations with different convexity numbers. The proof of the first result is a correction of Chartrand and Zhang's proof, and allows for an easy proof of the second result. The third result says roughly that graphs without end-vertices can be oriented anti-transitively.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alastair Farrugia,