Opening book details…
Can I read Near-automorphisms of Paths on EtoBox?
Near-automorphisms of Paths by Gerard J. Chang is a Computer Science article available to read on EtoBox.
What is Near-automorphisms of Paths about?
The total relative displacement of a permutation f of vertices of a connected graph , where the sum is taken over all ( n 2 ) unordered pairs of distinct vertices of G. Let (G) denote the smallest positive value of f (G) among the n! permutations f . Aitken [J Combin Theory Series A 87 (1999), 1-21] proved that (P n ) = 2n-4 for the n-path P n , which was conjectured by Chartrand et al. [Proceedings of the 1996 Eighth Quadrennial International Conference on Graph Theory, Combinatorics Algorithms, and Applications I, New Issues Press, Kalamazoo, 1999, pp. 181-192]. This article gives a short proof of the result.
Who reads Near-automorphisms of Paths?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Gerard J. Chang
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 2011
- Language
- EN
- Field
- Computer Science (Physical Sciences)