For the regular Sierpiński graphs S++(n,k), the spectrum is computed and S++(n,k) is shown to be a Cayley graph exactly when n=1, k≤2, or n=2 and k+1 is a prime power.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Some Algebraic Properties of Sierpi\'nski-Type Graphs
For the regular Sierpiński graphs S++(n,k), the spectrum is computed and S++(n,k) is shown to be a Cayley graph exactly when n=1, k≤2, or n=2 and k+1 is a prime power.