The median of Sierpinski graphs

Balakrishnan, Kannan; Changat, Manoj; Hinz, Andreas M. and Lekha, Divya Sindhu (2022): The median of Sierpinski graphs. In: Discrete Applied Mathematics, Vol. 319: pp. 159-170

Abstract

The median of a graph consists of those vertices which minimize the average distance to all other vertices. It plays an important role in optimization scenarios like facility location problems. Sierpinski graphs are the state graphs of the Switching Tower of Hanoi problem, a variant of the Tower of Hanoi game. They also provide optimum models for interconnection networks. In this study, we present our observations on the median of Sierpinski graphs. We conjecture that the number of median vertices in S3n is always 12, if n & GE;3, and that they lie around the inner ring of the standard drawing.(c) 2021 Elsevier B.V. All rights reserved.

• Item Type: Journal article
• Faculties: Mathematics, Computer Science and Statistics > Computer Science
• Subjects: 000 Computer science, information and general works > 004 Data processing computer science
• ISSN: 0166-218X
• Language: English