Vertex magic total labeling of middle and total graph of cycle
dc.contributor.author | Kumar, Vimal | |
dc.contributor.author | Vijayalakshmi, D. | |
dc.contributor.department | Other | tr_TR |
dc.contributor.faculty | Other | tr_TR |
dc.date.accessioned | 2021-11-04T08:01:39Z | |
dc.date.available | 2021-11-04T08:01:39Z | |
dc.date.issued | 2019-08-01 | |
dc.description.abstract | A vertex magic total labeling is a bijection from the union of the vertex set and edge set to the consecutive integers 1,2,3,....,v+e with the property that for every u in the vertex set, the sum of the label of u and the label of the edges incident with u is equal to k, for some constant k. In this paper, we establish the vertex magic labeling of some classes of graphs and provide some open problems related to it. | tr_TR |
dc.description.index | Trdizin | tr_TR |
dc.identifier.endpage | 1340 | tr_TR |
dc.identifier.issn/e-issn | 2618-6470 | |
dc.identifier.issue | 2 | tr_TR |
dc.identifier.startpage | 1335 | tr_TR |
dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.526518 | tr_TR |
dc.identifier.uri | http://hdl.handle.net/20.500.12575/75883 | |
dc.identifier.volume | 68 | tr_TR |
dc.language.iso | en | tr_TR |
dc.publisher | Ankara Üniversitesi Fen Fakültesi | tr_TR |
dc.relation.isversionof | 10.31801/cfsuasmas.526518 | tr_TR |
dc.relation.journal | Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics | tr_TR |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | tr_TR |
dc.subject | Graph labeling | tr_TR |
dc.subject | Middle graph | tr_TR |
dc.subject | Total graph | tr_TR |
dc.title | Vertex magic total labeling of middle and total graph of cycle | tr_TR |
dc.type | Article | tr_TR |