The ${{c}_{2}}$ invariant is an arithmetic graph invariant defined by Schnetz. It is useful for understanding Feynman periods. Brown and Schnetz conjectured that the ${{c}_{2}}$ invariant has a particular symmetry known as completion invariance. This paper will prove completion invariance of the ${{c}_{2}}$ invariant in the case where we are over the field with 2 elements and the completed graph has an odd number of vertices. The methods involve enumerating certain edge bipartitions of graphs; two different constructions are needed.

Under the unifying umbrella of a general result of Penrose and Yukich (Annals of Applied Probability13 (2003), 277-303) we give laws of large numbers (in the Lp sense) for the total power-weighted length of several nearest-neighbour-type graphs on random point sets in ℝd, d ∈ ℕ. Some of these results are known; some are new. We give limiting constants explicitly, where previously they have been evaluated in less generality or not at all. The graphs we consider include the k-nearest-neighbours graph, the Gabriel graph, the minimal directed spanning forest, and the on-line nearest-neighbour graph.