Results 231 to 240 of about 107,087 (251)
Some of the next articles are maybe not open access.
A Study on Graceful and ∅-Graceful Labeling of Some Graphs
International Journal of Computing Algorithm, 2017M. Radhika, V. S. Selvi
openaire +1 more source
Triangular Embeddings of Complete Graphs From Graceful Labellings of Paths
Journal of Combinatorial Theory Series B, 2007Bruce Richter, Luis Goddyn
exaly
On Locally Monotone Graceful Labelings
In previous versions some translations were missed and incorrect.openaire +1 more source
Graceful Labelling: State of the Art, Applications and Future Directions
Mathematics in Computer Science, 2011Ian Wanless, Ljiljana Brankovic
exaly
Graceful labelings of cyclic snakes.
Ars Comb., 2001A graph \(G=(V,E)\) with \(m\) edges is called graceful if there is an injection \(f\: V\to \{0,1,\dots ,m\}=A\) such that \(\{| f(x)-f(y)| \:\{x,y\}\in E\}=B\) equals \(\{1,2,\dots ,m\}\). It is nearly graceful if \(A\) is replaced by \(\{0,1,\dots ,m+1\}\) and \(B\) equals \(\{1,2,\dots ,m\}\) or \(\{1,2,\dots ,m-1,m+1\}\).
openaire +2 more sources
On Variations of Graceful Labelings.
Ars Comb., 2008M. A. Seoud, E. A. El Sakhawi
openaire +1 more source