Near automorphisms of trees with small total relative displacements
檔案
- 000248864800009.pdf (228.5 KB, Adobe PDF)
日期
2007-10-01
期刊名稱
JOURNAL OF COMBINATORIAL OPTIMIZATION
摘要
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.
所屬典藏
會議論文引用此條目
Chang, C.-F., & Fu, H.-L. (2007). Near automorphisms of trees with small total relative displacements. JOURNAL OF COMBINATORIAL OPTIMIZATION, 14(2-3), 191–195. https://doi.org/10.1007/s10878-007-9062-8
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/4041