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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
University of Zielona Góra
2019-02-01
|
| Collection: | Discussiones Mathematicae Graph Theory |
| Sujets: | |
| Accès en ligne: | https://doi.org/10.7151/dmgt.2086 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|