EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Very strongly connected graphs

Madison Cox, Kaylee Freudenthal, Hannah Golab, Ruth Perry, Jeff Rushall

American Journal of Combinatorics · 2025

DOI: 10.63151/amjc.v4i.36 ↗

Kurz gefasst

Fachartikel in der Zeitschrift American Journal of Combinatorics, 2025. Verfasst von Madison Cox und 4 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A simple connected graph is strongly connected if there exists a directed path between every pair of vertices in both directions. Robbins showed that every \(2\)-edge-connected graph can be given edge orientations that result in the graph being strongly connected. But a random assignment of edge directions may or may not result in a graph being strongly connected. We say that a \(2\)-edge-connected graph is very strongly connected if any choice of edge orientations that does not feature a vertex having maximal or minimal indegree yields a strongly connected graph. We classify all graphs as either very strongly connected or not very strongly connected.

Zitieren

APA

Cox, M., Freudenthal, K., Golab, H., Perry, R., & Rushall, J. (2025). Very strongly connected graphs. American Journal of Combinatorics. https://doi.org/10.63151/amjc.v4i.36

Vancouver

Cox M, Freudenthal K, Golab H, Perry R, Rushall J. Very strongly connected graphs. American Journal of Combinatorics. 2025. doi:10.63151/amjc.v4i.36

BibTeX
@article{Cox2025,
  author = {Cox, Madison and Freudenthal, Kaylee and Golab, Hannah and Perry, Ruth and Rushall, Jeff},
  title = {Very strongly connected graphs},
  journal = {American Journal of Combinatorics},
  year = {2025},
  doi = {10.63151/amjc.v4i.36}
}
Kostenlos starten →