摘要：Bandwidth labelling is one of the interesting labellings of graphs. The bandwidth of a simple graph is the minimum of all possible maximum differences of adjacent labelled vertices. We consider bandwidth calculation for the maximal planar graphs. We characterize bandwidth of graphs via power of paths and show embedding of some planar graphs in power of path graphs. We also show alternatively that all graphs having bandwidth at most 3 are planar and prove that Pn3 is maximal planar graph.
关键词：Labelling of graphs;bandwidth of graphs;planar graphs;bipartite graphs;and maximal planar graphs
