### Characterization of topologically 1-uniform dcsl graphs and learning graphs

#### 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 Article**

Gency 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.

#### Keywords

#### Full Text:

PDF#### References

B.D. Acharya, Set-valuations of Graphs and Their Applications. MRILecture Notes in Applied Mathematics, No.2, Mehta Research Institute of Mathematics and Mathematical Physics,(1983), Allahabad.

B.D. Acharya and K.A. Germina, Distance compatible Set-labeling of graphs, Indian J. Math. and Comp. Sci. 1 (2011) 49 - 54.

Bindhu K. Thomas and K. A. Germina, Distance compatible set-labeling index of graphs, Int. J. Contemp. Math. Sciences, Vol. 5, no. 19, 911 - 919

F. Harary, Graph Theory, Addison Wesley, Reading Massachusetts,(1969).

J C Falmagne, J P Doignon , Learning Spaces, Interdisciplinary Applied Mathematics (2011), Springer.

J.-P. Doignon, J.-Cl. Falmagne, Well-graded families of relations, Discrete Math., 173, (1997) 35-44.

K. A. Germina, Limiting Probability transition matrix of a condensed Fibonacci Tree, International Journal of Applied Mathematics, Vol. 31., No. 2 (2018), 241-249.

K. A. Germina, Gency Joseph and L. Benedict Michael Raj Characterization of $1$-uniform dcsl graphs and learning graphs, communicated

K.A. Germina and Jinto James, Characterization of 1-uniform dcsl graphs and well-graded family of sets, Advances and Applications in Discrete Mathematics, Vol.15, (2015) 113 - 123.

Germina, K.A., Jinto James, and Shaini P, Learning graphs and 1-uniform dcsl graphs, Discrete Mathematics, Algorithms and Applications, World Scientific, Vol.09, No. 04,(2017) 1750046

Michel Deza and Monique Laurent, Geometry of cuts and Metrices, LIENS-Ecole Normale Superieure (1996) France.

Sergei Ovchinnikov,Partial cubes: Structures, characterizations, and constructions, Discrete Mathematics, 308}(23) (2008) 5597-5621.

### Refbacks

- There are currently no refbacks.

**This site has been shifted to https://stmcomputers.stmjournals.com/**