1 paper
William Q. Erickson, Daniel Herden, Jonathan Meddaugh +3
Given a finite simple graph G, let M(G) denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in G. In this paper…