IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v24y2012i4d10.1007_s10878-011-9418-y.html
   My bibliography  Save this article

The paths embedding of the arrangement graphs with prescribed vertices in given position

Author

Listed:
  • Yuan-Hsiang Teng

    (Hungkuang University)

  • Jimmy J. M. Tan

    (National Chiao Tung University)

  • Chey-Woei Tsay

    (Providence University)

  • Lih-Hsing Hsu

    (Providence University)

Abstract

Let n and k be positive integers with n−k≥2. The arrangement graph A n,k is recognized as an attractive interconnection networks. Let x, y, and z be three different vertices of A n,k . Let l be any integer with $d_{A_{n,k}}(\mathbf{x},\mathbf{y}) \le l \le \frac{n!}{(n-k)!}-1-d_{A_{n,k}}(\mathbf{y},\mathbf{z})$ . We shall prove the following existance properties of Hamiltonian path: (1) for n−k≥3 or (n,k)=(3,1), there exists a Hamiltonian path R(x,y,z;l) from x to z such that d R(x,y,z;l)(x,y)=l; (2) for n−k=2 and n≥5, there exists a Hamiltonian path R(x,y,z;l) except for the case that x, y, and z are adjacent to each other.

Suggested Citation

  • Yuan-Hsiang Teng & Jimmy J. M. Tan & Chey-Woei Tsay & Lih-Hsing Hsu, 2012. "The paths embedding of the arrangement graphs with prescribed vertices in given position," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 627-646, November.
    • Handle: RePEc:spr:jcomop:v:24:y:2012:i:4:d:10.1007_s10878-011-9418-y
    DOI: 10.1007/s10878-011-9418-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-011-9418-y
    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-011-9418-y?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang, Guozhen & Wang, Dajin, 2021. "The structure fault tolerance of arrangement graphs," Applied Mathematics and Computation, Elsevier, vol. 400(C).

    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:24:y:2012:i:4:d:10.1007_s10878-011-9418-y. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.