文章基本信息

标题：The Bandwidth of Maximal Planar Graphs
本地全文：下载
作者：Ahmad Imtiaz
期刊名称：Research Journal of Recent Sciences
电子版ISSN：2277-2502
出版年度：2014
卷号：3
期号：9
页码：85-89
语种：English
出版社：International Science Community Association
摘要：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