Connected ($C_4$,Diamond)-free Graphs Are Uniquely Reconstructible from Their Token Graphs

Ruy Fabila-Monroy, Ana Laura Trujillo-Negrete

A diamond is the graph that is obtained from removing an edge from the complete graph on $4$ vertices. A ($C_4$,diamond)-free graph is a graph that does not contain a diamond or a…