On Embedding and NP-Complete Problems of Equitable Labelings

Iosr Journals, Samir K. VAIDYA, Chirag M. BARASARA · Figshare · 2015

The embedding and NP-complete problems in the context of various graph labeling schemes were remained in the focus of many researchers. Here we have explored embedding and NP-Complete problems for some variants of cordial labeling.

Read the paper · More papers on PaperTik