👉 In mathematics, "non-arcing" is a property of a graph that describes how many edges it has between two vertices. An example of a non-arcering graph would be an undirected graph with no loops or cycles. This means that there are no loops (where two vertices are connected by exactly one edge) and no cycles, which are paths in the graph where all vertices have only one outgoing edge.
