Characterization of 1-uniform dcsl graphs and learning graphs
Keywords:
dcsl graphs, 1-uniform dcsl graphs, wg-family of sets, learning graphsAbstract
A distance compatible set labeling (dcsl) of a connected graph G is an injective set assignment f : V(G) \(\longrightarrow\) 2X, X being a non empty ground set, such that the corresponding induced function f⊕ : E(G) \(\longrightarrow\) 2X \ {ϕ} given by f⊕(u,v) = f(u) ⊕ f(v) satisfies |f⊕(u,v)| = k\(_{(u,v)}^{f}\) dG(u,v) for every pair of distinct vertices u, v ∈ V(G), where dG(u,v) denotes the path distance between u and v and k\(_{(u,v)}^{f}\) is a constant, not necessarily an integer, depending on the pair of vertices u, v chosen. A dcsl f of G is k-uniform if all the constants of proportionality with respect to f are equal to k, and if G admits such a dcsl then G is called a k-uniform dcsl graph. Let \(\mathcal{F}\) be a family of subsets of a set X. A graph G is defined to be a learning graph, if it is a \(\mathcal{F}\)-induced graph of some learning space \(\mathcal{F}\). In this paper, we characterize 1-uniform dcsl learning graphs and discuss the embedding problems.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Germina K. Augusthy, Gency Joseph, L. Benedict Michael Raj

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

