- and -labeling problems on interval graphs

- and -labeling problems on interval graphs

For a given graph , the - and -labeling problems assign the labels to the vertices of . Let be the set of non-negative integers. An - and -labeling of a graph is a function such that , for respectively, where represents the distance (minimum number of edges) between the vertices and , and . The - an...

Full description

Bibliographic Details
Main Authors: Sk Amanathulla, Madhumangal Pal
Format: Article
Language:English
Published: Taylor & Francis Group 2017-12-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
frequency assignment
-labeling
interval graphs
Online Access:http://dx.doi.org/10.1016/j.akcej.2017.03.002

Internet

http://dx.doi.org/10.1016/j.akcej.2017.03.002

Similar Items