Conjecture on odd graceful graphs

MaRDI QIDQ2829337zbMATH OpenFDO

Authors Nataraj Neela, C. Selvaraj

Publication date 27 October 2016

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

graceful graphsodd graceful graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

A graph \(G=(V,E)\) with \(p\) vertices and \(q~\)edges is said to be odd graceful if there exists a mapping \(f:V\rightarrow \{0,\dots,2q-1\}\) such that if we set \(l(e):=\left| f(u)-f(v)\right| \) for an edge \(e=uv\) then \( \bigcup\limits_{e\in E}l(e)=\{1,3,\dots,2q-1\}.\)NEWLINENEWLINEThe authors show that some special classes of bipartite graphs are odd graceful.

Recommendations

• Odd-even graceful graphs
• Crown graphs and subdivision of ladders are odd graceful
• Constructing of odd graceful graph
• ODD GRACEFUL LABELINGS OF GRAPHS
• scientific article; zbMATH DE number 36203

Cited in

(9)

• Crown graphs and subdivision of ladders are odd graceful
• Odd-even graceful graphs
• scientific article; zbMATH DE number 6500343 (Why is no real title available?)
• Further results on edge - odd graceful graphs
• scientific article; zbMATH DE number 6874019 (Why is no real title available?)
• Constructing of odd graceful graph
• A quest for the odd-gracefulness of goldfish graphs
• On odd graceful graphs
• Odd-even gracefulness of splitting graph of some standard graphs

This page was built for publication: Conjecture on odd graceful graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829337)