Downloads provided by UsageCounts
doi: 10.3390/sym9080131
Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph G M is hyperbolic and that δ ( G M ) is comparable to diam ( G M ) . Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs; in fact, it is shown that 5 / 4 ≤ δ ( G M ) ≤ 5 / 2 . Graphs G whose Mycielskian have hyperbolicity constant 5 / 4 or 5 / 2 are characterized. The hyperbolicity constants of the Mycielskian of path, cycle, complete and complete bipartite graphs are calculated explicitly. Finally, information on δ ( G ) just in terms of δ ( G M ) is obtained.
Distance in graphs, Gromov hyperbolicity, extremal problems on graphs, Structural characterization of families of graphs, extremal problems on graphs; Mycielskian graphs; geodesics; Gromov hyperbolicity, Mycielskian graphs, geodesics
Distance in graphs, Gromov hyperbolicity, extremal problems on graphs, Structural characterization of families of graphs, extremal problems on graphs; Mycielskian graphs; geodesics; Gromov hyperbolicity, Mycielskian graphs, geodesics
| 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). | 5 | |
| 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). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 8 | |
| downloads | 14 |

Views provided by UsageCounts
Downloads provided by UsageCounts