Binary operation graphs

Basit Öğe Kaydı
dc.contributor.authorAl-Harere, Manal Naji
dc.contributor.authorOmran, Ahmed Abed Ali
dc.date.accessioned2024-07-12T20:46:40Z
dc.date.available2024-07-12T20:46:40Z
dc.date.issued2019en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractA graph labeling is an assignment of integers to the vertices, edges, or to both, and it is subject to certain conditions. In this paper, a new concept of graph labeling called binary operation labeling is introduced. Let G = (V, E) be a (n, m)-graph and let f : V(G) ? 1, 2, ..., n be a bijection. We define f ? on E(G) by f ? (uv) = (f(u) + f(v))/2 if both f(u) and f(v) are odd or both are even and f ? (uv) = (f(u)f(v))/2 if u is odd and v is even or vice versa for each uv ? E(G). If f ? is injective on E(G), then f is called a binary operation labeling. The graph G is said to be a binary operation graph if G admits a binary operation labeling. Some results for this new type of labeling are contributed.en_US
dc.identifier.citationAl-Harere, M. N., Omran, A. A. A. (2019). Binary operation graphs. International Conference of Mathematical Sciences. s. 030008(1)-030008(3).en_US
dc.identifier.endpage030008-3en_US
dc.identifier.isbn978-0-7354-1816-5
dc.identifier.startpage030008-1en_US
dc.identifier.urihttps://aip.scitation.org/doi/10.1063/1.5095093
dc.identifier.urihttps://hdl.handle.net/20.500.12415/1891
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.isversionof10.1063/1.5095093en_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY01350
dc.titleBinary operation graphsen_US
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu