標題: Near automorphisms of trees with small total relative displacements
作者: Chang, Chia-Fen
Fu, Hung-Lin
應用數學系
Department of Applied Mathematics
關鍵字: near automorphism;tree;total relative displacement
公開日期: 1-十月-2007
摘要: For a permutation f of the vertex set V(G) of a connected graph G, let delta(f) (x,y)=vertical bar d(x,y) - d(f(x),f(y))vertical bar. Define the displacement delta(f) (G) of G with respect to f to be the sum of delta(f) (x,y) over all unordered pairs {x,y} of distinct vertices of G. Let pi(G) denote the smallest positive value of delta(f) (G) among the n! permutations f of V(G). In this note, we determine all trees T with pi(T) = 2 or 4.
URI: http://dx.doi.org/10.1007/s10878-007-9062-8
http://hdl.handle.net/11536/4041
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9062-8
期刊: JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume: 14
Issue: 2-3
起始頁: 191
結束頁: 195
顯示於類別:會議論文


文件中的檔案:

  1. 000248864800009.pdf