EUVIMEDEUVIMED entdecken
Crossref

Distance Two labeling for Multi-Storey Graphs

J.Baskar Babujee, S Babitha

International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks · 2010

DOI: 10.5121/jgraphoc.2010.2303 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2010. Verfasst von J.Baskar Babujee und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

An L (2, 1)-labeling of a graph G (also called distance two labeling ) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| �2 if d(x, y) =1 and | f(x)- f(y)| �1 if d(x, y) =2. The L (2, 1 )-labeling number � (G) or span of G is the smallest k such that there is a f with

Zitieren

APA

Babujee, J., & Babitha, S. (2010). Distance Two labeling for Multi-Storey Graphs. International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks. https://doi.org/10.5121/jgraphoc.2010.2303

Vancouver

Babujee J, Babitha S. Distance Two labeling for Multi-Storey Graphs. International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks. 2010. doi:10.5121/jgraphoc.2010.2303

BibTeX
@article{Babujee2010,
  author = {Babujee, J.Baskar and Babitha, S},
  title = {Distance Two labeling for Multi-Storey Graphs},
  journal = {International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks},
  year = {2010},
  doi = {10.5121/jgraphoc.2010.2303}
}
Kostenlos starten →