An Effective Algorithm for Gracefulness on the Cartesian Product of Cayley Digraphs

Thamizharasi R., CANGÜL İ. N.

IAENG International Journal of Computer Science, cilt.51, sa.12, ss.1924-1932, 2024 (Scopus) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 51 Sayı: 12
  • Basım Tarihi: 2024
  • Dergi Adı: IAENG International Journal of Computer Science
  • Derginin Tarandığı İndeksler: Scopus, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.1924-1932
  • Anahtar Kelimeler: Cartesian product, Cayley digraph, Digraph labelling, Edge odd graceful, Super edge graceful
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

Labeled digraphs are frequently used to denote real-world issues because of their unique features. They were employed in modelling communication, interconnection networks, parallel computer architecture, field of bioinformatics and issues with DNA sequencing. Graceful labelings are proven to exist for a number of infinite classes of graphs. One can treat the present work as assistance to pick a suitable combinatorial model of large directed secured networks.