IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i2d10.1007_s10878-023-01013-w.html
   My bibliography  Save this article

Near automorphisms of complement or square of a path

Author

Listed:
  • Dein Wong

    (China University of Mining and Technology)

  • Jiahui Yin

    (China University of Mining and Technology)

  • Jiao Wang

    (China University of Mining and Technology)

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))|$$ δ f ( x , y ) = | d ( x , y ) - d ( f ( x ) , f ( y ) ) | and $$\delta _f (G)= \sum \delta _f (x,y)$$ δ f ( G ) = ∑ δ f ( x , y ) , where the sum is taken over all unordered pairs x, y of distinct vertices of G. Let $$\pi (G)$$ π ( G ) denote the smallest positive value of $$\delta _f (G)$$ δ f ( G ) among all permutations of V(G). A permutation f with $$\delta _f (G) =\pi (G)$$ δ f ( G ) = π ( G ) is called a near automorphism of G and $$\pi (G)$$ π ( 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})$$ π ( P n ¯ ) and $$\pi (P_n^2)$$ π ( P n 2 ) are determined. As a result, one can find how much the near automorphisms of $$\overline{P_n}$$ P n ¯ and $$P_n^2$$ P n 2 differ from those of $$P_n$$ P n .

Suggested Citation

  • Dein Wong & Jiahui Yin & Jiao Wang, 2023. "Near automorphisms of complement or square of a path," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-10, March.
  • Handle: RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-01013-w
    DOI: 10.1007/s10878-023-01013-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-01013-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-023-01013-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. H. L. Fu & C. L. Shiue & X. Cheng & D. Z. Du & J. M. Kim, 2001. "Quadratic Integer Programming with Application to the Chaotic Mappings of Complete Multipartite Graphs," Journal of Optimization Theory and Applications, Springer, vol. 110(3), pages 545-556, September.
    2. Chia-Fen Chang & Hung-Lin Fu, 2007. "Near automorphisms of trees with small total relative displacements," Journal of Combinatorial Optimization, Springer, vol. 14(2), pages 191-195, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alain Billionnet & Sourour Elloumi & Amélie Lambert, 2013. "An efficient compact quadratic convex reformulation for general integer quadratic programs," Computational Optimization and Applications, Springer, vol. 54(1), pages 141-162, January.
    2. N. P. Chiang, 2006. "Chaotic Numbers of Complete Bipartite Graphs and Tripartite Graphs," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 485-491, December.
    3. Alain Billionnet & Sourour Elloumi & Amélie Lambert, 2014. "A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 376-399, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-01013-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.