Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path

Simple item page
dc.contributor.authorGhosy, Sumonta
dc.contributor.authorPal, Anita
dc.contributor.departmentOthertr_TR
dc.contributor.facultyOthertr_TR
dc.date.accessioned2021-11-09T07:04:41Z
dc.date.available2021-11-09T07:04:41Z
dc.date.issued2019-08-01
dc.description.abstractCordial labeling is one of the useful labeling in the realm of graph labeling. For the graph G=(V,E) vertex set V is label by {0,1}, where labeling of edge set E calculated by absolute difference between the end vertices labeling with the restriction that number of vertices label by 0 and number of vertices label by 1, their absolute difference not exceeding 1. If similar restriction will follow for edge also then the labeling technique is known as cordial labeling and the graph which admits cordial labeling is known as cordial graph. In this paper we want to apply cordial labeling on a complex graph structure which we obtained by Cartesian product between complete bipartite graph(Balanced bipartite graph) K_{n,n} and path P_{r}. We also propose three algorithm to label the above said graph by cordial labeling. We have analyse the time complexity of each algorithm and which is super-linear.tr_TR
dc.description.indexTrdizintr_TR
dc.identifier.endpage2078tr_TR
dc.identifier.issn/e-issn2618-6470
dc.identifier.issue2tr_TR
dc.identifier.startpage2064tr_TR
dc.identifier.urihttps://doi.org/10.31801/cfsuasmas.586082tr_TR
dc.identifier.urihttp://hdl.handle.net/20.500.12575/75945
dc.identifier.volume68tr_TR
dc.language.isoentr_TR
dc.publisherAnkara Üniversitesi Fen Fakültesitr_TR
dc.relation.isversionof10.31801/cfsuasmas.586082tr_TR
dc.relation.journalCommunications Faculty of Sciences University of Ankara Series A1 Mathematics and Statisticstr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıtr_TR
dc.subjectCordial labelingtr_TR
dc.subjectCartesian product of graphstr_TR
dc.subjectGraph labelingtr_TR
dc.titleAlgorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and pathtr_TR
dc.typeArticletr_TR

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
70.pdf
Size:
740.2 KB
Format:
Adobe Portable Document Format
Description:
Dergi
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Cilt:68 Sayı:02 (2019)