We introduce a concept of “pseudo dual” pseudographs which can be thought of as generalizing some of the recent work on iterated clique graphs. In particular, we characterize those pseudographs which have pseudo duals and show that they encompass several natural families of intersection pseudographs.