Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs

DOI10.1080/09720529.2009.10698249zbMath1200.05198OpenAlexW1997916225MaRDI QIDQ3400287

K. L. Princy, K. A. Germina, Belmannu Devadas Acharya, Siddani Bhaskara Rao

Publication date: 5 February 2010

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2009.10698249

zbMATH Keywords

harmonious graphcordial graphstrongly \(c\)-harmonious graphelegant graphfelicitous graphpolychrome graphoddgraceful graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Topological integer additive set-sequential graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding and NP-completeness theorems for set-graceful, topologically set-graceful and set-sequential graphs