Yayın:
An effective algorithm for gracefulness on the cartesian product of cayley digraphs

Basit Görünüm
dc.contributor.authorThamizharasi R.
dc.contributor.authorCangül, İsmail Naci
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.departmentFen ve Edebiyat Fakültesi
dc.contributor.departmentMatematik Bölümü
dc.contributor.orcid0000-0002-0700-5774
dc.contributor.scopusid57189022403
dc.date.accessioned2025-08-06T22:37:04Z
dc.date.issued2024-01-01
dc.description.abstractLabeled 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.
dc.identifier.endpage1932
dc.identifier.issn1819-656X
dc.identifier.issue12
dc.identifier.scopus2-s2.0-85211159081
dc.identifier.startpage1924
dc.identifier.urihttps://hdl.handle.net/11452/53324
dc.identifier.volume51
dc.indexed.scopusScopus
dc.language.isoen
dc.publisherInternational Association of Engineers
dc.relation.journalIaeng International Journal of Computer Science
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectSuper edge graceful
dc.subjectEdge odd graceful
dc.subjectDigraph labelling
dc.subjectCayley digraph
dc.subjectCartesian product
dc.subject.scopusGraph Labeling and Topological Authentication Innovations
dc.titleAn effective algorithm for gracefulness on the cartesian product of cayley digraphs
dc.typeArticle
dspace.entity.typePublication
local.contributor.departmentFen ve Edebiyat Fakültesi/Matematik Bölümü
local.indexed.atScopus
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscovery601ef81f-9bdf-4a4a-9ac1-82a82260384d

Dosyalar

Koleksiyonlar

İndeksli Yayınlar / Indexed Publications