International Science Community Association Research Journal of Recent Sciences 2277 - 2502 3 9 2014 September 2 The Bandwidth of Maximal Planar Graphs 85 89 EN Yasrebdoost Hadi 1 Management Dept, Tabriz Branch, Islamic, Azad University, Tabriz, IRAN SarbazyMoghadam Saeid 2 SalmaGhassem Bagloo 3 Hassanpoor Davood 1 Department of Accounting, Faculty of Management and Accounting, Gilan Science and Research Branch, Islamic Azad University, Gilan, IRAN Pourali MohammadReza 2 Ghatge N.S. 1 Pravara Rural Education Society’s; Home Science and BCA College, Loni. Taluka -Rahata, District-Ahmednagar, Gujarat, INDIA Ashraf Muhammad 1 Department of Computer Science, Federal Urdu University of Arts, Sciences and Technology, Karachi, PAKISTAN Sarim Muhammad 2 Shaikh AbdulBasit 3 Sheikh KashifRaffat 4 Nadeem Adnan 5 Ahsan Kamran 6 Siddiq Muhammad 7 FazlollahZarepour Nasirabadi 1 Department of Public Management, Azad University of Kerman, Kerman, IRAN Vahedi Elham 2 Department of Executive Master of Business Administration,Alborz, IRAN Mahdi Vahedi 3 Department of Industrial Management, Islamic Azad University, Firoozkooh, IRAN Eshaghali Azizi 1 Department of Studies in Education, University of Mysore, Mysore, Karnataka, INDIA Mehri Basnas 1 University of Tabriz (Phd), Bahman Blvd, Tabriz, IRAN Anis Mohd 1 Crystal Growth Laboratory, Department of Physics, Milliya Arts Science and Management Science College, Beed-431122, Maharashtra, INDIA Mariajancyrani 1 Department of chemistry, A.V.V.M. Sri Pushpam College, Poondi, Thanjavur-613 503, Tamil Nadu, INDIA Chandramohan 2 School of Chemical and Biotechnology, Department of Chemistry, SASTRA University, Thanjavur, Tamil Nadu, INDIA Ravikumar 3 Ansari Bahareh 1 Dept. of Agricultural Development, College of Agriculture, Tehran Science and Research Branch, Islamic Azad University, Tehran, IRAN SeyedMehdi Mirdamadi 2 Dept. of Agricultural Extension and Education, College of Agriculture, Tehran Sci. and Research Branch, Islamic Azad Uni., Tehran, IRAN Hosseini SeyedJamalFarajollah 3 Dept. of Renewable Energy and Environmental Engineering, College of New Sciences and Technologies, University of Tehran, Tehran, IRAN Noorollahi Younes 4 G.O. Matthew 1 Glass and Ceramic Technology Department, School of Science and Computer Studies, Federal Polytechnic Ado-Ekiti, Ekiti State, NIGERIA B.O. Fatile 2 Shafakatullah Nannu 1 insNannu Shafakatullah* and M. Chandra Dept. of Bio-Sciences, Mangalore University, Mangalagangothri-574199, Mangalore, Karnataka, INDIA Chandra M. 2 Reaza AshrafiHabibAbadi 1 Natanz Branch, Islamic Azad University, Department of Electrical Engineering, Natanz, Isfahan, IRAN Nekoubin Abdolamir 2 Imtiaz Ahmad 1 Department of Mathematics, University of Malakand, Khyber Pakhtunkhwa, PAKISTAN > Research Article 2013 9 26 2014 September 2 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 thatis maximal planar graph. Copyright@ International Science Community Association