- 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...
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: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.03.002 |
Similar Items
-
A linear time algorithm to compute square of interval graphs and their colouring
by: Satyabrata Paul, et al.
Published: (2016-04-01) -
Energy of binary labeled graphs
by: Pradeep G. Bhat, et al.
Published: (2013-09-01) -
Neutrosophic Labeling Graph
by: M. Gomathi, et al.
Published: (2019-12-01) -
α_{2}-labeling of graphs
by: Dalibor Fronček
Published: (2009-01-01) -
Properly even harmonious labelings of disconnected graphs
by: Joseph A. Gallian, et al.
Published: (2015-11-01)