Graph labelings, embedding and NP-completeness theorems

MaRDI QIDQ3620783zbMATH OpenFDO

Authors K. A. Germina, K. L. Princy, B. D. Acharya, S. B. Rao

Publication date 14 April 2009

zbMATH Keywords

cordial graphelegant graphfelicitous graphharmonious graphodd-graceful graphpolychrome graphsstrongly harmonious graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs
• Graph labelings and complexity problems: a review
• scientific article; zbMATH DE number 6484457
• On sum composite graphs and embedding problems
• On the Harmonious Coloring of Graphs

Cited in

(4)

• Graph labelings and complexity problems: a review
• Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs
• Labelled (Hyper)Graphs, Negotiations and the Naming Problem
• On sum composite graphs and embedding problems

This page was built for publication: Graph labelings, embedding and NP-completeness theorems

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