首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Near automorphisms of trees with small total relative displacements
Authors:Chia-Fen Chang  Hung-Lin Fu
Institution:(1) Department of Applied Mathematics, National Chiao Tung University, Hsin Chu, 30050, Taiwan
Abstract:For a permutation f of the vertex set V(G) of a connected graph G, let δ f (x,y)=|d(x,y)−d(f(x),f(y))|. Define the displacement δ f (G) of G with respect to f to be the sum of δ f (x,y) over all unordered pairs {x,y} of distinct vertices of G. Let π(G) denote the smallest positive value of δ f (G) among the n! permutations f of V(G). In this note, we determine all trees T with π(T)=2 or 4. Dedicated to Professor Frank K. Hwang on the occasion of his 65th birthday.
Keywords:Near automorphism  Tree  Total relative displacement
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号