IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i1p118-d308069.html
   My bibliography  Save this article

On the Number of Shortest Weighted Paths in a Triangular Grid

Author

Listed:
  • Benedek Nagy

    (Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, North Cyprus, via Mersin 10, Famagusta 99450, Turkey)

  • Bashar Khassawneh

    (Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, North Cyprus, via Mersin 10, Famagusta 99450, Turkey)

Abstract

Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its dual, the triangular grid, paths between triangle pixels (we abbreviate this term to trixels) are counted. The number of shortest weighted paths between any two trixels of the triangular grid is discussed. For each trixel, there are three different types of neighbor trixels, 1-, 2- and 3-neighbours, depending the Euclidean distance of their midpoints. When considering weighted distances, the positive values α , β and γ are assigned to the ‘steps’ to various neighbors. We gave formulae for the number of shortest weighted paths between any two trixels in various cases by the respective weight values. The results are nicely connected to various numbers well-known in combinatorics, e.g., to binomial coefficients and Fibonacci numbers.

Suggested Citation

  • Benedek Nagy & Bashar Khassawneh, 2020. "On the Number of Shortest Weighted Paths in a Triangular Grid," Mathematics, MDPI, vol. 8(1), pages 1-16, January.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:1:p:118-:d:308069
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/1/118/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/1/118/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gergely Kovács & Benedek Nagy & Béla Vizvári, 2019. "Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 867-886, October.
    2. Nagy, B., 2002. "Metrics based on neighbourhood sequences in triangular grids," Pure Mathematics and Applications, Department of Mathematics, Corvinus University of Budapest, vol. 13(1-2), pages 259-274.
    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. Gergely Kovács & Benedek Nagy & Gergely Stomfai & Neşet Deniz Turgay & Béla Vizvári, 2021. "Discrete Optimization: The Case of Generalized BCC Lattice," Mathematics, MDPI, vol. 9(3), pages 1-20, January.
    2. Benedek Nagy, 2022. "Equivalence, Partial Order and Lattice of Neighborhood Sequences on the Triangular Grid," Mathematics, MDPI, vol. 10(23), pages 1-21, November.

    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:gam:jmathe:v:8:y:2020:i:1:p:118-:d:308069. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.