Some classes of dispersible dcsl-graphs
A distance compatible set labeling (dcsl) of a connected graph $G$ is an injective set assignment $f : V(G) \rightarrow 2^{X},$ $X$ being a non empty ground set, such that the corresponding induced function $f^{\oplus} :E(G) \rightarrow 2^{X}\setminus \{\phi\}$ given by $f^{\oplus}(uv)= f(u)\oplus f...
Main Authors: | J. Jinto, K.A. Germina, P. Shaini |
---|---|
Format: | Article |
Language: | English |
Published: |
Vasyl Stefanyk Precarpathian National University
2018-01-01
|
Series: | Karpatsʹkì Matematičnì Publìkacìï |
Subjects: | |
Online Access: | https://journals.pnu.edu.ua/index.php/cmp/article/view/1456 |
Similar Items
-
A Study on Topological Integer Additive Set-Labeling of Graphs
by: Sudev Naduvath
Published: (2015-03-01) -
Square Sum And Square Difference Labelings Of Semitotal-block Graph For Some Class Of Graphs
by: Keerthi G. Mirajkar, et al.
Published: (2023-06-01) -
Decomposition of complete graphs into small graphs
by: Dalibor Froncek
Published: (2010-01-01) -
A new class of graceful graphs: k-enriched fan graphs and their characterisations
by: M. Haviar, et al.
Published: (2021-08-01) -
On permutation graphs
by: M.A. Seoud, et al.
Published: (2012-07-01)