The Shields-Harary number for wheel and broken wheel graphs
type: Item
instance of: scholarly article
title: The Shields-Harary number for wheel and broken wheel graphs
zbMATH Open document ID: 0826.05038
DOI: 10.1016/0166-218X(93)E0162-R
author: Jared Wunsch
published in: Discrete Applied Mathematics
publication date: 1995-11-26T00:00:00Z
review text: 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.
reviewed by: J.Sedláček
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 761083
zbMATH Keywords: broken wheel graphs
zbMATH Keywords: networks
zbMATH Keywords: Shields-Harary number
zbMATH Keywords: wheel graphs
zbMATH Keywords: wheel
zbMATH Keywords: bounds
MaRDI profile type: Publication
cites work: Q4028479
cites work: A Combinatorial Problem of Shields and Pearcy
full work available at URL: 0166-218x(93)e0162-r
OpenAlex ID: W2012443951
description: scientific article; zbMATH DE number 761083