Search papers, labs, and topics across Lattice.
Affiliation:
1
0
A graph's status as twin-free—having strictly unique neighborhoods across all vertices—can be definitively identified solely from its collection of single-vertex-deleted cards.