Department of Computer Science
Fort Hays State University
Hays, Kansas

On k-Cordial Labeling

In this paper we introduce a concept so-called k-cordial labeling to generalize the concept of cordial labeling. We establish the connection between k-cordial labeling and Fibonacci cordial labeling. We propose a faster brute force search algorithm to check the existence of Fibonacci cordial labeling. Finally, we extend the results to Tribonacci cordial labeling.

View Paper