Abstract
In this paper, we observe a special class of graphs known as multilayered graphs and their subclasses, namely multilayered cycles and multilayered paths. These graphs model layouts of shopping malls, city street grids, and even resemble the topology of certain famous board games. We analyze the values of all vertex spans (strong, direct, and Cartesian span) for these subclasses of graphs. Surprisingly, our results for multilayered cycles reveal that, regardless of the chosen movement rules, the span values depend solely on the length of the individual cycles, rather than the number of layers. This finding carries significant implications for the application of graph spans in maintaining safety distances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
