A study on set-cordial labeling of graphs

dc.contributor.authorNaduvath, Sudev
dc.contributor.departmentOthertr_TR
dc.contributor.facultyOthertr_TR
dc.date.accessioned2022-12-27T07:39:23Z
dc.date.available2022-12-27T07:39:23Z
dc.date.issued2022
dc.description.abstractFor a non-empty ground set X, finite or infinite, the set-valuation or set-labeling of a given graph G is an injective function f:V(G)→P(X), where P(X) is the power set of the set X. In this paper, we introduce a new type of set-labeling, called set-cordial labeling and study the characteristics of graphs which admit the set-cordial labeling.tr_TR
dc.description.indexTrdizintr_TR
dc.identifier.endpage348tr_TR
dc.identifier.issn/e-issn1303-5991
dc.identifier.issue2tr_TR
dc.identifier.startpage339tr_TR
dc.identifier.urihttps://doi.org/10.31801/cfsuasmas.547410tr_TR
dc.identifier.urihttp://hdl.handle.net/20.500.12575/86485
dc.identifier.volume71tr_TR
dc.language.isoentr_TR
dc.publisherAnkara Üniversitesitr_TR
dc.relation.isversionof10.31801/cfsuasmas.547410tr_TR
dc.relation.journalCommunications, Series A1:Mathematics and Statisticstr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıtr_TR
dc.subjectSet-labeling of graphs, set-cordial labeling, set-cordial graphs, weakly set-cordial graphs.tr_TR
dc.titleA study on set-cordial labeling of graphstr_TR
dc.typeArticletr_TR

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
10.31801-cfsuasmas.547410-684619.pdf
Size:
470.7 KB
Format:
Adobe Portable Document Format
Description:
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: