1 publication
-
Published Subscription
Characterization of topologically 1-uniform dcsl graphs and learning graphsBy Germina K. Augusthy, Gency Joseph, L Benedict Michael RAj
Abstract: 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(v)$ satisfies $ |f^{\oplus}(uv)| = k_{(u,v)}^{f}d_{G}(u,v) $ for every pair of distinct vertices $u, v \in V(G),$ where $d_{G}(u,v)$ denotes the path distance between $u$ and $v$ …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 6–10 Read article →