Graph labelings and complexity problems: a review

MaRDI QIDQ3172281zbMATHFDO

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

Publication date 5 October 2011

zbMATH Keywords

complexityNP-completenessgraceful graphharmonious graphdifference graphcordial graphlabelings of graphssquare sum graphstrongly \(c\)-harmonious graph\(L(h,k)\)-graphadditively geometric graphbitopological graphcycle-stochastic graphedge cycle stochastic graphelegant graphfelicitous graphodd-graceful graphpolychrome graphset graceful graphsigma graphtopogenic graphtopological set graceful

Mathematics Subject Classification ID

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

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
• Publication:4944992

Cited in

(6)

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

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)