$Ld(2,1)$-labeling on $T$-graphs

In this paper, we are concerned with the $T$-Graphs, which are graphs defined based on the Topological structure of the given set. Precisely, for a given topology $T$ on a set $X$, a $T$-Graph ‘$G=(V,E)$’ is an undirected simple graph with the vertex set $V$ as $P(X)$ and the edge set $E$ as the set of all unordered pairs of nodes $u,v$ in $V$, denoted by $(u,v)\text{ or }(v,u)$, satisfying either ‘$u\in T$ and $u^{\text{c}}\cap v\in T$’ (or) ‘$v\in T$ and $v^{\text{c}}\cap u\in T$’.

The main purpose of this paper is to study the structure of $T$-Graphs for various topologies $T$ on a set $X$. Our goals in this paper are threefold. First, to show the $L_d(2,1)$ labeling number $\lambda (G,d)$ of any $T$-Graph $G$ exists finitely, if the labeling is $d$ multiple of non-negative integral values. In addition to show this labeling number $\lambda (G,d)$ is not just bounded above but bounded below as well. Second, to measure the bound values in terms of $d$ multiple of the order of the $T$-Graphs and finding a relation between the order of the $T$-Graphs and the maximum degree $\mathrm{\Delta }$ of the $T$-Graphs. Finally, third is to show that in case of $L(2,1)$$T$-graphs on a set with atleast 2 elements, the labeling number is $2(\mathrm{\Delta }+1)$ and is smaller than that of Griggs and Yeh’s conjecture value ${\mathrm{\Delta }}^2$.