Characterization of topologically 1-uniform dcsl graphs and learning graphs

Germina K. Augusthy; Gency Joseph; L Benedict Michael RAj

doi:10.37591/rrdms.v5i3.1833

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$ 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}}.$ A graph $G$ is called a topologically $k$-uniform dcsl graph, if $\{f(V(G)\}$, the collection of vertex labeling of $G$ is a topology. In this paper, we characterize topologically $1$-uniform dcsl learning graphs.Cite this ArticleGency Joseph, L. Benedict Michael Raj, Germina K. Augusthy. Characterization of Topologically 1-Uniform DCSL Graphs and Learning Graphs. Research & Reviews: Discrete Mathematical Structures. 2018; 5(3): 6–10p.

Abstract

Keywords