Characterization of 1-uniform dcsl graphs and learning graphs

Authors

  • Germina K. Augusthy Central University of Kerala - Department of Mathematics
  • Gency Joseph St. Joseph's College - Department of Mathematics
  • L. Benedict Michael Raj St. Joseph's College - Department of Mathematics

Keywords:

dcsl graphs, 1-uniform dcsl graphs, wg-family of sets, learning graphs

Abstract

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

2020-07-31

How to Cite

Augusthy, G. K., Joseph, G., & Raj, L. B. M. (2020). Characterization of 1-uniform dcsl graphs and learning graphs . Italian Journal of Pure and Applied Mathematics, 44, 530–537. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7452

Issue

Section

Articoli - Forum Editrice

Most read articles by the same author(s)

Similar Articles

<< < 9 10 11 12 13 14 15 16 17 18 > >> 

You may also start an advanced similarity search for this article.