Sum divisor cordial labeling in Certain Graphs

  • RENUKESWARA RAO JAGGENA Dept of mathematics , GIET university, GUNUPUR, odissa
  • P. Vijaykumar Department of Mathematics, Gandhi Institute of Engineering and Technology University, Gunupur, Odissa, India https://orcid.org/0000-0003-0652-0747

Resumo

In this paper, we prove the existence of sum divisor cordial labeling in the duplicate graphs of
path, comb, twig, star, and bistar graphs.

Downloads

Não há dados estatísticos.
Publicado
2025-10-17
Seção
Mathematics and Computing - Innovations and Applications (ICMSC-2025)