Modeling and Analysis of Small Cage Graphs: A New Algorithmic Approach | Chapter 1 | Research and Applications Towards Mathematics and Computer Science Vol. 4

 A cage diagram is a specific type of diagram where all allure nodes have the alike regularity and the unchanging girth. There is a restricted amount of instances of cage graphs because they must meet specific borders regarding the number of knots. In this paper, a study about the smallest instances of cage graphs is projected, where an treasure is presented so concerning model the behavior of each instance when it meets expectations move from one likely source bud towards a particular goal node. In order to aid the design of those algorithms, a node dispersion scheme is exhibited to label the nodes complicated in each case, as well as a traffic identification blueprint so as to label the edges connected to each bud. In summary, the objective of the study is find the shortest way to move among some pair of nodes inside the smallest cage graphs by way of designing an effective algorithm for each particular case, place such algorithms meet the necessities with a restricted number of steps.

Author(s) Details:

Pedro J. Roig,
Miguel Hernández University, Elche, Spain and University of the Balearic, Islands, Spain.

Salvador Alcaraz,
Miguel Hernández University, Elche, Spain.

Katja Gilly,
Miguel Hernández University, Elche, Spain.

Cristina Bernad,
Miguel Hernández University, Elche, Spain.

Carlos Juiz,
University of the Balearic, Islands, Spain.

Please see the link here: https://stm.bookpi.org/RATMCS-V4/article/view/11809