| dc.creator | Patodia, Harish | |
| dc.creator | Saikia, Helen K. | |
| dc.date | 2023-01-26 | |
| dc.date.accessioned | 2023-03-09T18:10:05Z | |
| dc.date.available | 2023-03-09T18:10:05Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5190 | |
| dc.identifier | 10.22199/issn.0717-6279-5190 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/223033 | |
| dc.description | Let G(V,E) be a graph. An m-Zumkeller cordial labeling of the graph G is defined by an injective function f:V -> N such that there exists an induced function f*:E -->{0,1} defined by f* (uv)=f(u).f(v) that satisfies the following conditions:i) For every uv in E,
f*(uv)= ii) |ef*(0)-ef*(1)|<=1where ef*(0) and ef*(1) denote the number of edges of the graph G having label 0 and 1 respectively under f*.In this paper we prove that there exist an m -Zumkeller cordial labeling of graphs viz., (i) paths (ii) cycles (iii) comb graphs (iv) ladder graphs (v) twig graphs (vi) helm graphs (vii) wheel graphs (viii) crown graphs (ix) star graphs. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/5190/4231 | |
| dc.rights | Copyright (c) 2023 Harish Patodia, Helen K. Saikia | en-US |
| dc.rights | https://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 42 No. 1 (2023); 65-84 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 42 Núm. 1 (2023); 65-84 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2023-01 | |
| dc.subject | m-Zumkeller numbers | en-US |
| dc.subject | comb graphs | en-US |
| dc.subject | ladder graph | en-US |
| dc.subject | twig graphs | en-US |
| dc.subject | helm graphs | en-US |
| dc.subject | 11Axx | en-US |
| dc.subject | 97F60 | en-US |
| dc.subject | 05Cxx | en-US |
| dc.title | A note on m-Zumkeller cordial labeling of graphs | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
