Results 271 to 280 of about 219,967 (286)
Some of the next articles are maybe not open access.
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
Graceful labeling of some zero divisor graphs
Electronic Notes in Discrete Mathematics, 2017Sk Md Abu Nayeem
exaly
On Variations of Graceful Labelings.
Ars Comb., 2008M. A. Seoud, E. A. El Sakhawi
openaire +1 more source
Super Edge Magic Graceful Labeling of Generalized Petersen Graphs
Electronic Notes in Discrete Mathematics, 2015S Kavitha, G Marimuthu
exaly