The Shields-Harary number for wheel and broken wheel graphs (Q1891927)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Shields-Harary number for wheel and broken wheel graphs |
scientific article |
Statements
The Shields-Harary number for wheel and broken wheel graphs (English)
0 references
26 November 1995
0 references
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.
0 references
broken wheel graphs
0 references
networks
0 references
Shields-Harary number
0 references
wheel graphs
0 references
wheel
0 references
bounds
0 references
