EUVIMEDEUVIMED entdecken
Crossref

On the Oriented Diameter of Graphs With Given Minimum Degree

Garner Cochran, Zhiyu Wang

Journal of Graph Theory · 17.07.2026

DOI: 10.1002/jgt.70099 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 17.07.2026. Verfasst von Garner Cochran und 1 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Erdős et al. proved that the diameter of a connected ‐vertex graph with minimum degree is at most . The oriented diameter of an undirected graph , denoted by , is the minimum diameter of a strongly connected orientation of . Bau and Dankelmann showed that for every bridgeless ‐vertex graph with minimum degree . They also showed an infinite family of graphs with oriented diameter at least and posed the problem of determining the smallest possible value for which holds. In this paper, we asymptotically answer Bau and Dankelmann's question by showing that the smallest value approaches 1 as approaches infinity.

Zitieren

APA

Cochran, G., & Wang, Z. (2026). On the Oriented Diameter of Graphs With Given Minimum Degree. Journal of Graph Theory. https://doi.org/10.1002/jgt.70099

Vancouver

Cochran G, Wang Z. On the Oriented Diameter of Graphs With Given Minimum Degree. Journal of Graph Theory. 2026. doi:10.1002/jgt.70099

BibTeX
@article{Cochran2026,
  author = {Cochran, Garner and Wang, Zhiyu},
  title = {On the Oriented Diameter of Graphs With Given Minimum Degree},
  journal = {Journal of Graph Theory},
  year = {2026},
  doi = {10.1002/jgt.70099}
}
Kostenlos starten →