Graph labelings and complexity problems: a review

MaRDI QIDQ3172281zbMATH OpenFDO

Authors K. A. Germina, S. B. Rao

Publication date 5 October 2011

zbMATH Keywords

\(L(h,k)\)-graphadditively geometric graphbitopological graphcomplexitycordial graphcycle-stochastic graphdifference graphedge cycle stochastic graphelegant graphfelicitous graphgraceful graphharmonious graphlabelings of graphsNP-completenessodd-graceful graphpolychrome graphset graceful graphsigma graphsquare sum graphstrongly \(c\)-harmonious graphtopogenic graphtopological set graceful

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Graph labelings, embedding and NP-completeness theorems
• Algorithmic complexity of proper labeling problems
• Fixed-parameter complexity of \(\lambda\)-labelings
• Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs
• scientific article; zbMATH DE number 1420920

Cited in

(6)

• Labelled (Hyper)Graphs, Negotiations and the Naming Problem
• scientific article; zbMATH DE number 5178701 (Why is no real title available?)
• Graph labelings, embedding and NP-completeness theorems
• Algorithmic complexity of proper labeling problems
• Some open problems on graph labelings
• Graph Labelings: A Prime Area to Explore

This page was built for publication: Graph labelings and complexity problems: a review

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