Neighborhood and. Self-Dual (Multi)Graphs

Abstract

We introduce neighborhood intersection graphs and multigraphs of loop-graphs to generalize the standard notions of square and distance-two graphs. These neighborhood (multi)graphs are then used to construct self-dual graphs and multigraphs (embedded on surfaces of varying genus) which have involutory vertex-face mappings.