Published January 19, 2011
| Version v1
Journal article
Open
Lucas Graceful Labeling for Some Graphs
Authors/Creators
Description
By a graph, we mean a finite undirected graph without loops or multiple edges.
Files
GracefulLabeling.pdf
Files
(329.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:9f331d17a37760e653bf880a06a8aca5
|
329.2 kB | Preview Download |