On the graceful polynomials of a graph

MaRDI QIDQ5377026zbMATH OpenFDO

Authors Andrea Vietri

Publication date 23 May 2019

Full work available at URL http://ajc.maths.uq.edu.au/pdf/73/ajc_v73_p261.pdf

zbMATH Keywords

graceful graphgraceful polynomial

Mathematics Subject Classification ID

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

Recommendations

• Node-graceful graphs
• Researches on the gracefulness of the unconnected graph \(G_{n-1}\bigcup\limits^k_{i=0}C_{3^i(2n+1)}\)
• scientific article; zbMATH DE number 4160785
• The gracefulness of the join of graphs. II
• ON SOME NEW GRACEFUL GRAPHS

Cites work

• A dynamic survey of graph labeling
• scientific article; zbMATH DE number 108348 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• Necessary conditions on graceful labels: a study case on trees and other examples
• Sailing towards, and then against, the graceful tree conjecture: some promisuous results

Cited in

(9)

• Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs
• Graver degrees are not polynomially bounded by true circuit degrees
• Rook polynomials on two-dimensional surfaces and graceful labellings of graphs
• scientific article; zbMATH DE number 6000786 (Why is no real title available?)
• scientific article; zbMATH DE number 3878981 (Why is no real title available?)
• On the enumeration of a class of non-graceful graphs
• scientific article; zbMATH DE number 14020 (Why is no real title available?)
• scientific article; zbMATH DE number 1214995 (Why is no real title available?)
• Real-graceful labellings: a generalisation of graceful labellings.

This page was built for publication: On the graceful polynomials of a graph

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