Abstract
In [23], Klavžar and Milutinović (1997) proved that there exist at most two different shortest paths between any two vertices in Sierpiński graphs Skn, and showed that the number of shortest paths between any fixed pair of vertices of Skn can be computed in O(n). An almost-extreme vertex of Skn, which was introduced in Klavžar and Zemljič (2013) [27], is a vertex that is either adjacent to an extreme vertex or incident to an edge between two subgraphs of Skn isomorphic to Skn−1. In this paper, we completely determine the set Su={v∈V(Skn):there exist two shortest u,v-paths in Skn}, where u is any almost-extreme vertex of Skn.
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.
