Antibandwidth problem for itchy caterpillars

Md Sazzadur Rahaman, Tousif Ahmed Eshan, Sad Al Abdullah, Md Saidur Rahman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

The antibandwidth problem is to label the vertices of a graph of n vertices by 1, 2, 3,..., n bijectively, such that the minimum difference of labels of adjacent vertices is maximized. The antibandwidth problem is known as NP-hard for general graphs. In this paper, we give an antibandwidth labeling scheme for a special class of trees called itchy caterpillar and study the lower bound of antibandwidth problem for the same class of graphs. We also give exact results for some of its subclasses. The result for itchy caterpillars with hair length 1, is the first nontrivial exact result of antibandwidth problem for any class of graphs.

Original languageEnglish (US)
Title of host publication2014 International Conference on Informatics, Electronics and Vision, ICIEV 2014
PublisherIEEE Computer Society
ISBN (Print)9781479951796
DOIs
StatePublished - 2014
Externally publishedYes
Event2014 International Conference on Informatics, Electronics and Vision, ICIEV 2014 - Dhaka, Bangladesh
Duration: May 23 2014May 24 2014

Publication series

Name2014 International Conference on Informatics, Electronics and Vision, ICIEV 2014

Conference

Conference2014 International Conference on Informatics, Electronics and Vision, ICIEV 2014
Country/TerritoryBangladesh
CityDhaka
Period5/23/145/24/14

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Antibandwidth problem for itchy caterpillars'. Together they form a unique fingerprint.

Cite this