Abstract
Let G be a connected graph with vertex set V(G), f a permutation of V(G). Define \(\delta _f (x,y)=|d(x,y)-d(f(x),f(y))|\) and \(\delta _f (G)= \sum \delta _f (x,y)\), where the sum is taken over all unordered pairs x, y of distinct vertices of G. Let \(\pi (G)\) denote the smallest positive value of \(\delta _f (G)\) among all permutations of V(G). A permutation f with \(\delta _f (G) =\pi (G)\) is called a near automorphism of G and \(\pi (G)\) is called the value of near automorphisms of G. In this paper, the near automorphisms of the complement of a path and the near automorphisms of the square of a path are characterized, respectively. Moreover, \(\pi (\overline{P_n})\) and \(\pi (P_n^2)\) are determined. As a result, one can find how much the near automorphisms of \(\overline{P_n}\) and \(P_n^2\) differ from those of \(P_n\).
Similar content being viewed by others
Data Availability
Enquiries about data availability should be directed to the authors.
References
Aitken W (1999) Total relative displacement of permutations. J Combin Theory A 87:1–21
Chang GJ (2011) Near-Automorphisms of Paths. J Graph Theory 68:323–325
Chang C-F, Fu H-L (2007) Near automorphisms of trees with small total relative displacements. J Comb Optim 14:191–195
Chang C-F, Chen B-L, Fu H-L (2008) Near automorphisms of cycles. Discret Math 308:1088–1092
Chartrand G, Gavlas H, Vander Jagt DW (1999) Near-automorphisms of graphs, graph theory, combinatorics and applications. In: Alavi Y, Lick D, Schwenk AJ (eds) Proceedings of the 1996 eighth quadrennial international conference on graph theory, combinatorics, algorithms and applications, vol 1. New Issues Press, Kalamazoo, pp 181–192
Cheng X, Du D-Z, Fu H-L, Kim J-M, Shiue C-L (2001) Quadratic integer programming with application in chaotic mappings of complete multipartite graphs. J Optim Theory Appl 110(3):545–556
Cheng K-C, Chiang N-P, Fu H-L, Tzeng C-K (2008) A study of total relative displacement of permutations. Util Math 75:139–157
Reid KB (2002) Total relative displacement of vertex permutations of \(K_{ n_1, n_2,\ldots , n_t}\). J Graph Theory 41:85–100
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have not disclosed any competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Dein Wong supported by the National Natural Science Foundation of China (No. 11971474).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wong, D., Yin, J. & Wang, J. Near automorphisms of complement or square of a path. J Comb Optim 45, 76 (2023). https://doi.org/10.1007/s10878-023-01013-w
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-023-01013-w