Bipartite half
In graph theory, the bipartite half or half-square of a bipartite graph G = is a graph whose vertex set is one of the two sides of the bipartition and in which there is an edge uiuj for each two vertices ui and uj in U that are at distance two from each other in G. That is, in a more compact notation, the bipartite half is G2 where the superscript 2 denotes the square of a graph and the square brackets denote an induced subgraph.
For instance, the bipartite half of the complete bipartite graph Kn,n is the complete graph Kn and the bipartite half of the hypercube graph is the halved cube graph.
When G is a distance-regular graph, its two bipartite halves are both distance-regular. For instance, the halved Foster graph is one of finitely many degree-6 distance-regular locally linear graphs.
The map graphs, that is, the intersection graphs of interior-disjoint simply-connected regions in the plane, are exactly the bipartite halves of bipartite planar graphs.
