Star graph is a complete bipartite graph K, a tree with internal node and K leaves.
Fig: Star Graph
In a planar drawing of a graph, the edges divide up the plane into connected regions. These regions are called faces.
A planar embedding of a connected graph consists of a non-empty set of closed walks of the graph called the discrete faces of the embedding.