The Shields-Harary number for wheel and broken wheel graphs
The author claims that no algorithm is known for calculating the Shields- Harary number, shortly SH. First he lists some special formulas of \(\text{SH}(G)\) from \textit{P. D. Johnson jun.} [Congr. Numerantium 82, 193- 200 (1991; Zbl 0764.05094)], e.g. \(\text{SH}(K_{1, n- 1})= \lfloor n^2/4\rfloor+ 1\). Further he studies the parameter SH for wheel graphs and wheel graphs with deleted outer edges. Proposition 1 and 2, both on upper and lower bounds, are too complicated to present them here.
scientific article; zbMATH DE number 761083