Vertex graceful labeling of some classes of graphs
Abstract: A connected graph G = (V,E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection ʄ : V → { 1, 2, 3, ··· p } such that the induced function ʄ*: E → { 0, 1, 2, ··· q-1} defined by ʄ*(uv) = (@...
Saved in:
| Main Authors: | , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2018
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000100019 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|