The dart graph is the 5-vertex graph illustrated above.
Together with the butterfly graph, the dart graph is one of the two smallest fully 5-forested graph.
It is implemented in the Wolfram Language as GraphData["DartGraph"].
Dart Graph
See also
Dart, Kite GraphExplore with Wolfram|Alpha
References
Barrett, W.; Hunnell, M.; Hutchens, J.; and Sinkovic, J. "The Classification of Graphs on 8 Vertices with Coinciding Zero Forcing Number and Maximum Nullity." 12 Jun 2025. https://arxiv.org/abs/2506.10726.Brandstädt, A.; Le, V. B.; and Spinrad, J. P. Graph Classes: A Survey. Philadelphia, PA: SIAM, p. 18, 1987.House of Graphs. "Dart Graph." https://houseofgraphs.org/graphs/1026.ISGCI: Information System on Graph Class Inclusions v2.0. "List of Small Graphs." https://www.graphclasses.org/smallgraphs.html.West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, p. 12, 2000.Referenced on Wolfram|Alpha
Dart GraphCite this as:
Weisstein, Eric W. "Dart Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DartGraph.html