L(2, 1)-Labeling of Circulant Graphs
An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one. Let λ12(Γ) denote the least λ such that Γ admits an L(2, 1)-labe...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
University of Zielona Góra
2019-02-01
|
| Col·lecció: | Discussiones Mathematicae Graph Theory |
| Matèries: | |
| Accés en línia: | https://doi.org/10.7151/dmgt.2086 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|