
Several classes of finite distance spaces and the corresponding classes of graphs are considered \((l_ 1\)-space, \(h\)-embeddable, spherical, hypermetric and of negative type). The focus is on hypermetric graphs. Several characterization results for hypermetric graphs are given. In particular, connected regular hypermetric graphs of diameter \(\leq 2\) are characterized and hypermetric strongly regular graph are enumerated. Hypermetric distance regular graphs are also investigated. Characterization of hypermetric Taylor graphs is given. It is also shown that for Taylor graphs it is equivalent to be hypermetric, to be of negative type, and to be spherical. Characterizations of extreme and regular hypermetric graphs are also derived.
Distance in graphs, strongly regular graph, Association schemes, strongly regular graphs, characterization, Structural characterization of families of graphs, finite distance spaces, hypermetric graphs, Enumeration in graph theory, distance regular graphs, hypermetric Taylor graphs
Distance in graphs, strongly regular graph, Association schemes, strongly regular graphs, characterization, Structural characterization of families of graphs, finite distance spaces, hypermetric graphs, Enumeration in graph theory, distance regular graphs, hypermetric Taylor graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 15 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
