Modular Sumset Labelling of Graphs
Graph labelling is an assignment of labels or weights to the vertices and/or edges of a graph. For a ground set X of integers, a sumset labelling of a graph is an injective map f:VG→PX such that the induced function f⊕:EG→PX is defined by f+uv=fu+fv, for all uv∈EG, where fu+fv is the sumset of the set-label, the vertices u and v. In this chapter, we discuss a special type of sumset labelling of a graph, called modular sumset labelling and its variations. We also discuss some interesting characteristics and structural properties of the graphs which admit these new types of graph labellings.
1988 ◽
Vol 447
(3)
◽
pp. 103-116
◽
1984 ◽
Vol 127
(1-3)
◽
pp. 214-218
◽
Keyword(s):
Keyword(s):
1998 ◽
Vol 08
(PR2)
◽
pp. Pr2-47-Pr2-50
Keyword(s):
2000 ◽
Vol 10
(PR7)
◽
pp. Pr7-95-Pr7-98
◽
2013 ◽
Vol 51
(9)
◽
pp. 691-699
Keyword(s):
1962 ◽
Vol 78
(12)
◽
pp. 579-617
◽
2007 ◽
Vol 2007
(suppl_26)
◽
pp. 503-508