Published October 3, 2011
| Version v1
Journal article
Open
Lucas Gracefulness of Almost and Nearly for Some Graphs
Authors/Creators
Description
By a graph, we mean a finite undirected graph without loops or multiple edges.