Labelling of Cactus Graphs
Nasreen Khan, Madhumangal Pal, Anita Pal · Mapana Journal of Sciences · 2012
The -labelling of a graph is an abstraction of assigning integer frequencies to radio transmitters such that the transmitters that are one unit of distance apart receive frequencies that differ by at least two, and transmitters that are two units of distance apart receive frequencies that differ by at least one. The span of an -labelling is the difference between the largest and the smallest assigned frequency. The -labelling number of a graph , denoted by , is the least integer such that has an -labelling of span . A cactus graph is a connected graph in which every block is either an edge or a cycle. The goal of the problem is to show that for a cactus graph , where is the degree of . An optimal algorithm is also presented here to label the vertices of cactus graph using -labelling technique in time, where is the total number of vertices of the cactus graph.