A carregar...
Further results on super graceful labeling of graphs
Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G. We say G is k-super graceful if it admits a k-super graceful labeling. Fo...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Taylor & Francis Group
2016-08-01
|
| Colecção: | AKCE International Journal of Graphs and Combinatorics |
| Assuntos: | |
| Acesso em linha: | http://www.sciencedirect.com/science/article/pii/S0972860015300505 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|